Adaptive Partitioning of Traffic Without Additional Probe Traffic
    1.
    发明申请
    Adaptive Partitioning of Traffic Without Additional Probe Traffic 有权
    没有附加探测流量的流量自适应分区

    公开(公告)号:US20100124262A1

    公开(公告)日:2010-05-20

    申请号:US12271196

    申请日:2008-11-14

    IPC分类号: H04B17/00

    摘要: 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,以及一对或多对通信信道的信道独立性度量。

    Adaptive partitioning of traffic without additional probe traffic
    2.
    发明授权
    Adaptive partitioning of traffic without additional probe traffic 有权
    流量的自适应分区,无需额外的探测流量

    公开(公告)号:US07953023B2

    公开(公告)日:2011-05-31

    申请号:US12271196

    申请日:2008-11-14

    IPC分类号: H04B17/00

    摘要: 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,以及一对或多对通信信道的信道独立性度量。

    Probationary admission control in relay networks
    4.
    发明授权
    Probationary admission control in relay networks 有权
    中继网络中的预约接纳控制

    公开(公告)号:US08391154B2

    公开(公告)日:2013-03-05

    申请号:US11861079

    申请日:2007-09-25

    IPC分类号: G01R31/08

    摘要: 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.

    摘要翻译: 公开了一种技术,其旨在通过分组网络直接和重新引导分组流,而不会不利地影响现有流的服务质量。 根据本发明的说明性实施例,通过分组网络被引导和重定向的分组流最初被试用。 在试用期间,将流量的服务质量度量与其初始值为高的阈值进行比较,并随时间减少。 这具有快速注意问题的有利影响,可以快速修复。

    Evaluating quality of service in an IP network with cooperating relays
    5.
    发明授权
    Evaluating quality of service in an IP network with cooperating relays 有权
    用合作继电器评估IP网络中的服务质量

    公开(公告)号:US08107385B2

    公开(公告)日:2012-01-31

    申请号:US11329933

    申请日:2006-01-11

    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)第二子网络中的第二节点之间的网络路径。 网络路径中的“弹射”节点通过探测一个或两个子网络来评估路径,其中弹性节点用作在两个子网络之间传输的业务分组的中继。 给定的中继只能在任何给定的时间探测子网内的单个代表性节点,以获得代表子网的性能数据。 通过探测代表节点,中继器能够获取对于继电器和子网中的任何端点之间的路径有效的网络条件的评估。 因此,所公开的技术减少了给定子网上的许多端点节点同时处于活动状态并且经历不利的网络条件时的探测开销。

    Adaptive Parameterized Search Algorithm
    6.
    发明申请
    Adaptive Parameterized Search Algorithm 有权
    自适应参数化搜索算法

    公开(公告)号:US20100169374A1

    公开(公告)日:2010-07-01

    申请号:US12344244

    申请日:2008-12-25

    IPC分类号: G06F7/06 G06F17/30 G06F7/00

    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.

    摘要翻译: 公开了一种用于进行搜索的方法,其中在搜索期间进行和更新时变属性的测量,并且其中测量可能不确定。 根据说明性实施例,在基于搜索的过程中动态地调整一个或多个搜索算法参数(例如,搜索树的最大分支因子,搜索树的深度截止值,时间截止值,阈值等) 在以下至少一个中:测量的不确定度,随时间的测量的可变性(例如,标准偏差等)以及测量优于阈值的成员的分数。 此外,说明性实施例使得能够基于这些标准修剪搜索空间。

    Adaptive parameterized search algorithm
    7.
    发明授权
    Adaptive parameterized search algorithm 有权
    自适应参数化搜索算法

    公开(公告)号:US08266165B2

    公开(公告)日:2012-09-11

    申请号:US12344244

    申请日:2008-12-25

    IPC分类号: G06F7/00 G06F17/30

    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.

    摘要翻译: 公开了一种用于进行搜索的方法,其中在搜索期间进行和更新时变属性的测量,并且其中测量可能不确定。 根据说明性实施例,在基于搜索的过程中动态地调整一个或多个搜索算法参数(例如,搜索树的最大分支因子,搜索树的深度截止值,时间截止值,阈值等) 在以下至少一个中:测量的不确定度,随时间的测量的可变性(例如,标准偏差等)以及测量优于阈值的成员的分数。 此外,说明性实施例使得能够基于这些标准修剪搜索空间。

    Evaluating feasible transmission paths in a packet network
    8.
    发明授权
    Evaluating feasible transmission paths in a packet network 有权
    评估分组网络中的可行传输路径

    公开(公告)号:US07697460B2

    公开(公告)日:2010-04-13

    申请号:US11765242

    申请日:2007-06-19

    IPC分类号: H04L12/56

    摘要: A technique is disclosed that attempts to improve the evaluation of a network path's signal quality, as well as the selection of a network path for transmission purposes, without some of the costs and disadvantages of doing so in the prior art. In accordance with the illustrative embodiment, a node with access to the packet network, such as a VoIP telephone endpoint, evaluates the quality of service that is associated with each of multiple network paths. The evaluation process is iterative, in which the number of candidate paths is successively reduced from one iteration of the technique to the next. The multiple paths that remain as candidates in any given iteration are evaluated concurrently and at an evaluation bit rate that i) is less than the full transmission rate of the real-time traffic (VoIP) packets to be sent and ii) varies as a function of the number of candidate paths remaining under consideration.

    摘要翻译: 公开了一种技术,其尝试改进对网络路径的信号质量的评估,以及用于传输目的的网络路径的选择,而不是在现有技术中这样做的一些成本和缺点。 根据说明性实施例,具有诸如VoIP电话端点的分组网络的访问节点评估与多个网络路径中的每一个相关联的服务质量。 评估过程是迭代的,其中候选路径的数量从技术的一次迭代到下一个迭代继续减少。 在任何给定迭代中保持作为候选的多个路径被并发地评估,并且在i)小于要发送的实时业务(VoIP)分组的全传输速率的评估比特率下进行评估,ii)作为功能而变化 的候选人路数仍在考虑之中。

    Evaluating Feasible Transmission Paths in a Packet Network
    9.
    发明申请
    Evaluating Feasible Transmission Paths in a Packet Network 有权
    评估分组网络中的可行传输路径

    公开(公告)号:US20080080540A1

    公开(公告)日:2008-04-03

    申请号:US11765242

    申请日:2007-06-19

    IPC分类号: H04L12/56

    摘要: A technique is disclosed that attempts to improve the evaluation of a network path's signal quality, as well as the selection of a network path for transmission purposes, without some of the costs and disadvantages of doing so in the prior art. In accordance with the illustrative embodiment, a node with access to the packet network, such as a VoIP telephone endpoint, evaluates the quality of service that is associated with each of multiple network paths. The evaluation process is iterative, in which the number of candidate paths is successively reduced from one iteration of the technique to the next. The multiple paths that remain as candidates in any given iteration are evaluated concurrently and at an evaluation bit rate that i) is less than the full transmission rate of the real-time traffic (VoIP) packets to be sent and ii) varies as a function of the number of candidate paths remaining under consideration.

    摘要翻译: 公开了一种技术,其尝试改进对网络路径的信号质量的评估,以及用于传输目的的网络路径的选择,而不是在现有技术中这样做的一些成本和缺点。 根据说明性实施例,具有诸如VoIP电话端点的分组网络的访问节点评估与多个网络路径中的每一个相关联的服务质量。 评估过程是迭代的,其中候选路径的数量从技术的一次迭代到下一个迭代继续减少。 在任何给定迭代中保持作为候选的多个路径被并发地评估,并且在i)小于要发送的实时业务(VoIP)分组的全传输速率的评估比特率下进行评估,ii)作为功能而变化 的候选人路数仍在考虑之中。

    Probationary Admission Control in Relay Networks
    10.
    发明申请
    Probationary Admission Control in Relay Networks 有权
    中继网络中的预约接纳控制

    公开(公告)号:US20080080523A1

    公开(公告)日:2008-04-03

    申请号:US11861079

    申请日:2007-09-25

    IPC分类号: H04L12/56

    摘要: 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.

    摘要翻译: 公开了一种技术,其旨在通过分组网络直接和重新引导分组流,而不会不利地影响现有流的服务质量。 根据本发明的说明性实施例,通过分组网络被引导和重定向的分组流最初被试用。 在试用期间,将流量的服务质量度量与其初始值为高的阈值进行比较,并随时间减少。 这具有快速注意问题的有利影响,可以快速修复。