会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Rapid fault detection and recovery for internet protocol telephony
    • 互联网协议电话快速故障检测和恢复
    • US07782787B2
    • 2010-08-24
    • US10953024
    • 2004-09-29
    • Mark John KarolParameshwaran KrishnanJuan Jenny Li
    • Mark John KarolParameshwaran KrishnanJuan Jenny Li
    • G01R31/08
    • H04L43/50H04L43/10H04L65/80H04L69/40
    • Techniques for performing rapid fault detection and recovery in communication networks are disclosed. For example, in one aspect of the invention, a technique for detecting one or more conditions in a communication network comprises the following steps/operations. One or more keep-alive packets are transmitted from a source node in the communication network to a destination node in the communication network over two or more paths between the source node and the destination node, wherein the two or more paths are at least partially disjoint. Upon receipt of the one or more keep-alive packets at the destination node via the two or more paths, at least one quality measure is computed at the destination node for each of the two or more paths, the at least one quality measure being indicative of one or more conditions in the communication network. While not limited thereto, the invention is particularly well-suited to Internet Protocol (IP) telephony networks, particularly those that provide Voice over IP (VoIP) applications.
    • 公开了在通信网络中执行快速故障检测和恢复的技术。 例如,在本发明的一个方面,用于检测通信网络中的一个或多个条件的技术包括以下步骤/操作。 一个或多个保持活动分组从通信网络中的源节点通过源节点和目的地节点之间的两个或多个路径发送到通信网络中的目的地节点,其中两个或更多个路径至少部分地不相交 。 经由两个或多个路径在目的地节点处接收到一个或多个保持活动分组时,在目的地节点处针对两个或更多个路径中的每一个计算至少一个质量度量,所述至少一个质量度量指示 通信网络中的一个或多个条件。 虽然不限于此,本发明特别适用于因特网协议(IP)电话网络,特别是那些提供IP语音(VoIP)应用的电话网络。
    • 5. 发明申请
    • Creating a Telecommunications Channel from Multiple Channels that Have Differing Signal-Quality Guarantees
    • 从具有不同信号质量保证的多个频道创建电信频道
    • US20090016370A1
    • 2009-01-15
    • US11775549
    • 2007-07-10
    • Mark John Karol
    • Mark John Karol
    • H04L12/56
    • H04L45/22H04L5/0037H04L5/006H04L45/00H04L45/02H04L45/24H04L45/302H04L45/306H04L47/12H04L47/14
    • A technique is disclosed that enables the adaptive pooling of M transmission paths that offer a first signal-quality guarantee, or no guarantee at all, with N transmission paths that offer a second signal-quality guarantee. Through this adaptive pooling, a telecommunications channel is created that meets the quality of service or waveform quality required for a packet stream being transmitted, while not excessively exceeding the required quality. The technique adaptively recaptures any excess signal quality from one path and uses it to boost the quality of an inferior path. A node of the illustrative embodiment selects the paths to handle a current segment of source packets, based on one or more parameters that are disclosed herein. The node adapts to changing conditions by adjusting the transmission characteristics for each successive segment of packets from the source packet stream.
    • 公开了一种技术,其能够提供提供第一信号质量保证或完全不保证的提供第二信号质量保证的N个传输路径的M个传输路径的自适应池。 通过这种自适应池,创建一个电信信道,以满足正在发送的分组流所需的服务质量或波形质量,而不会超过所需的质量。 该技术从一条路径自适应地重新捕获任何过剩的信号质量,并用它来提高劣质路径的质量。 说明性实施例的节点基于本文公开的一个或多个参数来选择处理源分组的当前分段的路径。 节点通过调整来自源分组流的每个连续的分组段的传输特性来适应变化的条件。
    • 6. 发明授权
    • Adaptive parameterized search algorithm
    • 自适应参数化搜索算法
    • US08266165B2
    • 2012-09-11
    • US12344244
    • 2008-12-25
    • Bengi Karacali-AkyamacMark John KarolParameshwaran Krishnan
    • Bengi Karacali-AkyamacMark John KarolParameshwaran Krishnan
    • G06F7/00G06F17/30
    • G06F17/30463
    • A method is disclosed for conducting a search in which measurements of a time-varying property are made and updated during the search, and in which the measurements might be uncertain. In accordance with the illustrative embodiment, one or more search algorithm parameters (e.g., the maximum branching factor of a search tree, a depth cutoff for a search tree, a time cutoff, a threshold, etc.) are adjusted dynamically during the search based on at least one of: the degree of uncertainty of the measurements, the variability of measurements over time (e.g., standard deviation, etc.), and the fraction of members whose measurement is better than a threshold. In addition, the illustrative embodiment enables the search space to be pruned based on these criteria.
    • 公开了一种用于进行搜索的方法,其中在搜索期间进行和更新时变属性的测量,并且其中测量可能不确定。 根据说明性实施例,在基于搜索的过程中动态地调整一个或多个搜索算法参数(例如,搜索树的最大分支因子,搜索树的深度截止值,时间截止值,阈值等) 在以下至少一个中:测量的不确定度,随时间的测量的可变性(例如,标准偏差等)以及测量优于阈值的成员的分数。 此外,说明性实施例使得能够基于这些标准修剪搜索空间。
    • 9. 发明申请
    • Interfering Packet Streams in Packet Networks
    • 干扰分组网络中的分组流
    • US20090122713A1
    • 2009-05-14
    • US11939293
    • 2007-11-13
    • Bengi Karacali-AkyamacMark John KarolBalaji Sathyanarayana Rao
    • Bengi Karacali-AkyamacMark John KarolBalaji Sathyanarayana Rao
    • H04L12/26
    • H04L41/12H04L43/50
    • A method for estimating the network-layer topology of a telecommunications network is described. In particular, the illustrative embodiment of the present invention estimates the existence and connectivity of nodes in the topology based on the detection of network-wide end-to-end path intersections. This is based on the assumption that pairs of streams of packets that share a common node will interfere and that the interference can be detected in the received streams. In general, this interference is manifested as jitter. By transmitting streams on each pair of end-to-end paths in the network, and detecting interference (or a lack of interference) a matrix of path intersections for the network can be created. Using logic and supposition, the topology of the network can be estimated using the matrix of path intersections. Once the estimate of the topology is complete, the maintenance and operation of the network can proceed based on the topology.
    • 描述了用于估计电信网络的网络层拓扑的方法。 特别地,本发明的说明性实施例基于网络范围端到端路径交叉点的检测来估计拓扑中节点的存在和连通性。 这是基于共享公共节点的分组流对将干扰并且可以在接收的流中检测干扰的假设。 一般来说,这种干扰表现为抖动。 通过在网络中的每对端对端路径上发送流,并且检测干扰(或缺乏干扰),可以创建网络的路径交叉矩阵。 使用逻辑和假设,可以使用路径交点的矩阵来估计网络的拓扑。 拓扑结构的估计一旦完成,网络的维护和运行就可以根据拓扑结构进行。