-
公开(公告)号：US20100124262A1
公开(公告)日：2010-05-20
申请号：US12271196
申请日：2008-11-14
IPC分类号： H04B17/00
CPC分类号： H04L1/0001 , H04L1/0015 , H04L1/02 , H04L1/20
摘要： A method is disclosed for adaptively and intelligently partitioning traffic among a plurality of communications channels, without injecting probe traffic into any of the channels. In accordance with the illustrative embodiment, a source node transmits traffic to a receiving node via K communications channels in accordance with partition coefficients α1, . . . , αK, and the source node receives information regarding the quality of service (QoS) provided by each of the communications channels. The source node adjusts the values of the partition coefficients α1, . . . , αK adaptively based on: the current channel QoS information, prior channel QoS information, the prior values of α1, . . . , αK, and a measure of channel independence for one or more pairs of communications channels.
摘要翻译： 公开了一种用于在多个通信信道之间自适应和智能地划分业务的方法，而不将探测业务注入到任何信道中。 根据说明性实施例，源节点根据分区系数α1，经由K个通信信道向接收节点发送业务。 。 。 ，αK，并且源节点接收关于由每个通信信道提供的服务质量（QoS）的信息。 源节点调整分区系数α1，...的值。 。 。 ，αK自适应地基于：当前信道QoS信息，先前信道QoS信息，α1的先前值。 。 。 ，αK，以及一对或多对通信信道的信道独立性度量。
-
公开(公告)号：US07953023B2
公开(公告)日：2011-05-31
申请号：US12271196
申请日：2008-11-14
IPC分类号： H04B17/00
CPC分类号： H04L1/0001 , H04L1/0015 , H04L1/02 , H04L1/20
摘要： A method is disclosed for adaptively and intelligently partitioning traffic among a plurality of communications channels, without injecting probe traffic into any of the channels. In accordance with the illustrative embodiment, a source node transmits traffic to a receiving node via K communications channels in accordance with partition coefficients α1, . . . , αK, and the source node receives information regarding the quality of service (QoS) provided by each of the communications channels. The source node adjusts the values of the partition coefficients α1, . . . , αK adaptively based on: the current channel QoS information, prior channel QoS information, the prior values of α1, . . . , αK, and a measure of channel independence for one or more pairs of communications channels.
摘要翻译： 公开了一种用于在多个通信信道之间自适应和智能地划分业务的方法，而不将探测业务注入到任何信道中。 根据说明性实施例，源节点根据分区系数α1，经由K个通信信道向接收节点发送业务。 。 。 ，αK，并且源节点接收关于由每个通信信道提供的服务质量（QoS）的信息。 源节点调整分区系数α1，...的值。 。 。 ，αK自适应地基于：当前信道QoS信息，先前信道QoS信息，α1的先前值。 。 。 ，αK，以及一对或多对通信信道的信道独立性度量。
-
3.发明授权Coding and packet distribution for alternative network paths in telecommunications networks 有权电信网络中替代网络路径的编码和分组分发公开(公告)号：US09306852B2
公开(公告)日：2016-04-05
申请号：US11342193
申请日：2006-01-27
申请人： Eric John Diethorn , Bengi Karacali-Akyamac , Mark John Karol , Anjur Sundaresan Krishnakumar , Parameshwaran Krishnan , Jean Meloche
发明人： Eric John Diethorn , Bengi Karacali-Akyamac , Mark John Karol , Anjur Sundaresan Krishnakumar , Parameshwaran Krishnan , Jean Meloche
IPC分类号： H04L12/725 , H04L5/06 , H04L29/06 , H04L12/811 , H04L12/801 , H04L12/707
CPC分类号： H04L47/10 , H04L45/24 , H04L45/302 , H04L47/38
摘要： A method and apparatus are disclosed that seek to improve the quality of service that is experienced during the transmission of a stream of packets across one or more paths. In particular, a transmitting node encodes a source stream of data (e.g., audio, video, etc.) into one or more sub-streams, and distributes those sub-streams onto multiple network transmission paths. In accordance with the illustrative embodiment of the present invention, the transmitting node evaluates the quality of service of a first network path that fails to provide a quality-of-service guarantee. When the quality of service of the first network path becomes unsatisfactory, the coding of one or more sub-streams that are being transmitted on a second network path is adjusted. In other words, the coding on a second channel is adjusted in response to the changing conditions on a first channel.
摘要翻译： 公开了一种方法和装置，其尝试提高在一个或多个路径上的分组流传输期间经历的服务质量。 具体地，发送节点将数据源（例如，音频，视频等）编码成一个或多个子流，并将这些子流分配到多个网络传输路径上。 根据本发明的说明性实施例，发送节点评估不能提供服务质量保证的第一网络路径的服务质量。 当第一网络路径的服务质量不能令人满意时，调整在第二网络路径上发送的一个或多个子流的编码。 换句话说，响应于第一信道上的变化条件来调整第二信道上的编码。
-
公开(公告)号：US08391154B2
公开(公告)日：2013-03-05
申请号：US11861079
申请日：2007-09-25
IPC分类号： G01R31/08
CPC分类号： H04L45/00 , H04L45/22 , H04L45/28 , H04L45/306
摘要： A technique that seeks to direct and re-direct streams of packets through a packet network without adversely affecting the quality of service of existing streams is disclosed. In accordance with the illustrative embodiment of the present invention, streams of packets that are directed and re-directed through a packet network are initially put on probation. During the probation period, a quality-of-service measure for the stream is compared with a threshold whose value is initially high and decreases with time. This has the advantageous affect of noticing problems quickly so that they can be remediated quickly.
摘要翻译： 公开了一种技术，其旨在通过分组网络直接和重新引导分组流，而不会不利地影响现有流的服务质量。 根据本发明的说明性实施例，通过分组网络被引导和重定向的分组流最初被试用。 在试用期间，将流量的服务质量度量与其初始值为高的阈值进行比较，并随时间减少。 这具有快速注意问题的有利影响，可以快速修复。
-
公开(公告)号：US20100169374A1
公开(公告)日：2010-07-01
申请号：US12344244
申请日：2008-12-25
CPC分类号： 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.
摘要翻译： 公开了一种用于进行搜索的方法，其中在搜索期间进行和更新时变属性的测量，并且其中测量可能不确定。 根据说明性实施例，在基于搜索的过程中动态地调整一个或多个搜索算法参数（例如，搜索树的最大分支因子，搜索树的深度截止值，时间截止值，阈值等） 在以下至少一个中：测量的不确定度，随时间的测量的可变性（例如，标准偏差等）以及测量优于阈值的成员的分数。 此外，说明性实施例使得能够基于这些标准修剪搜索空间。
-
公开(公告)号：US08266165B2
公开(公告)日：2012-09-11
申请号：US12344244
申请日：2008-12-25
CPC分类号： 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.
摘要翻译： 公开了一种用于进行搜索的方法，其中在搜索期间进行和更新时变属性的测量，并且其中测量可能不确定。 根据说明性实施例，在基于搜索的过程中动态地调整一个或多个搜索算法参数（例如，搜索树的最大分支因子，搜索树的深度截止值，时间截止值，阈值等） 在以下至少一个中：测量的不确定度，随时间的测量的可变性（例如，标准偏差等）以及测量优于阈值的成员的分数。 此外，说明性实施例使得能够基于这些标准修剪搜索空间。
-
7.发明授权公开(公告)号：US08107385B2
公开(公告)日：2012-01-31
申请号：US11329933
申请日：2006-01-11
申请人： Bengi Karacali-Akyamac , Mark John Karol , Anjur Sundaresan Krishnakumar , Parameshwaran Krishnan , Jean Meloche
发明人： Bengi Karacali-Akyamac , Mark John Karol , Anjur Sundaresan Krishnakumar , Parameshwaran Krishnan , Jean Meloche
IPC分类号： H04L12/26
摘要： A technique is disclosed that evaluates a network path between (i) a first node in a first subnetwork of endpoint nodes, such as IP phones, and (ii) a second node in a second subnetwork. A “ricochet” node in the network path evaluates the path by probing one or both subnetworks, where the ricochet node acts as relay for traffic packets being transmitted between the two subnetworks. A given relay has only to probe a single, representative node within a subnetwork at any given time in order to obtain performance data that is representative of the subnetwork overall. By probing the representative node, the relay is able to acquire an assessment of network conditions that is valid for the path between the relay and any endpoint in the subnetwork. As a result, the disclosed technique reduces the probing overhead when many endpoint nodes on a given subnetwork are simultaneously active and experiencing adverse network conditions.
摘要翻译： 公开了一种技术，其评估（i）端点节点的第一子网络中的第一节点（例如IP电话）和（ii）第二子网络中的第二节点之间的网络路径。 网络路径中的“弹射”节点通过探测一个或两个子网络来评估路径，其中弹性节点用作在两个子网络之间传输的业务分组的中继。 给定的中继只能在任何给定的时间探测子网内的单个代表性节点，以获得代表子网的性能数据。 通过探测代表节点，中继器能够获取对于继电器和子网中的任何端点之间的路径有效的网络条件的评估。 因此，所公开的技术减少了给定子网上的许多端点节点同时处于活动状态并且经历不利的网络条件时的探测开销。
-
公开(公告)号：US07961647B2
公开(公告)日：2011-06-14
申请号：US11939295
申请日：2007-11-13
IPC分类号： H04L12/28
CPC分类号： H04L43/50 , H04L41/12 , H04L43/087
摘要： 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.
摘要翻译： 描述了用于估计电信网络的网络层拓扑的方法。 特别地，本发明的说明性实施例基于网络范围端到端路径交叉点的检测来估计拓扑中节点的存在和连通性。 这是基于共享公共节点的分组流对将干扰并且可以在接收的流中检测干扰的假设。 一般来说，这种干扰表现为抖动。 通过在网络中的每对端对端路径上发送流，并且检测干扰（或缺乏干扰），可以创建网络的路径交叉矩阵。 使用逻辑和假设，可以使用路径交点的矩阵来估计网络的拓扑。 拓扑结构的估计一旦完成，网络的维护和运行就可以根据拓扑结构进行。
-
公开(公告)号：US07720005B2
公开(公告)日：2010-05-18
申请号：US11939297
申请日：2007-11-13
IPC分类号： H04L12/26
CPC分类号： H04L43/50 , H04L41/12 , H04L43/087
摘要： 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.
摘要翻译： 描述了用于估计电信网络的网络层拓扑的方法。 特别地，本发明的说明性实施例基于网络范围端到端路径交叉点的检测来估计拓扑中节点的存在和连通性。 这是基于共享公共节点的分组流对将干扰并且可以在接收的流中检测干扰的假设。 一般来说，这种干扰表现为抖动。 通过在网络中的每对端对端路径上发送流，并且检测干扰（或缺乏干扰），可以创建网络的路径交叉矩阵。 使用逻辑和假设，可以使用路径交点的矩阵来估计网络的拓扑。 拓扑结构的估计一旦完成，网络的维护和运行就可以根据拓扑结构进行。
-
公开(公告)号：US07720004B2
公开(公告)日：2010-05-18
申请号：US11939293
申请日：2007-11-13
IPC分类号： H04L12/26
摘要： 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.
摘要翻译： 描述了用于估计电信网络的网络层拓扑的方法。 特别地，本发明的说明性实施例基于网络范围端到端路径交叉点的检测来估计拓扑中节点的存在和连通性。 这是基于共享公共节点的分组流对将干扰并且可以在接收的流中检测干扰的假设。 一般来说，这种干扰表现为抖动。 通过在网络中的每对端对端路径上发送流，并且检测干扰（或缺乏干扰），可以创建网络的路径交叉矩阵。 使用逻辑和假设，可以使用路径交点的矩阵来估计网络的拓扑。 拓扑结构的估计一旦完成，网络的维护和运行就可以根据拓扑结构进行。
-
-
-
-
-
-
-
-
-
搜索结果
28 条记录 (耗时 0.017 秒)
