公开(公告)号：US07161902B2

公开(公告)日：2007-01-09

申请号：US10156428

申请日：2002-05-28

申请人： Malcolm Carter ,  David Ireland ,  Kevin Warbrick ,  Jon Weil ,  Peter Hamer ,  Richard Clegg ,  Arthur Clune

发明人： Malcolm Carter ,  David Ireland ,  Kevin Warbrick ,  Jon Weil ,  Peter Hamer ,  Richard Clegg ,  Arthur Clune

IPC分类号： H04J1/16

CPC分类号： H04L47/10 ,  H04L45/00 ,  H04L45/566 ,  H04L45/60 ,  H04L47/11 ,  H04L47/12 ,  H04L47/22 ,  H04L47/24 ,  H04L47/25 ,  H04L47/41 ,  Y02D50/30

摘要： Congestion control in a communications network, e.g. an Internet Protocol (IP) network, is effected by controlling the egress rate of traffic from the output buffer of the system routers or switches. The traffic egressing from an output buffer is sampled at sequential intervals to determine a bit rate at each interval. An autocorrelation function is calculated from these samples and is used to provide an estimated statistical measure or parameter indicative of congestion and related to a long range dependence of the traffic. A calculation is then made as to whether an increase or a decrease in the buffer output rate would result in a decrease in the congestion parameter, and the buffer output rate is adjusted accordingly.

摘要翻译： 通信网络中的拥塞控制，例如 通过控制来自系统路由器或交换机的输出缓冲器的流量的出口速率来实现因特网协议（IP）网络。 从输出缓冲区流出的业务以连续的间隔进行采样，以确定每个间隔的比特率。 从这些样本计算自相关函数，并用于提供指示拥塞并与流量的长程依赖关系相关的估计统计量度或参数。 然后计算缓冲器输出速率的增加或减小是否会导致拥塞参数的减少，并且相应地调整缓冲器输出速率。

公开(公告)号：US07380017B2

公开(公告)日：2008-05-27

申请号：US09848743

申请日：2001-05-03

申请人： Jon Weil ,  Alex Morrall ,  David Odhams ,  Kenneth Hayward ,  Loa Andersson

发明人： Jon Weil ,  Alex Morrall ,  David Odhams ,  Kenneth Hayward ,  Loa Andersson

IPC分类号： G06F15/173

CPC分类号： H04L41/12 ,  H04L41/0668 ,  H04L45/12 ,  H04L45/22 ,  H04L69/40

摘要： A communications network comprises a lower transport layer and an upper overlay incorporating a plurality of routers. Adjacencies are defined between respective pairs of routers. Path protection is provided by defining a software model of the overlay of the network and defining in the model a hierarchy of protection levels for the main path. Each protection level is characterised by a respective set of one or more broken adjacencies in the model, the adjacencies to be broken being determined from a knowledge of the underlying topology. A protection level is selected and a protection path avoiding the broken adjacencies associated with that protection level is calculated. If this calculated path is not available in the real network, a lower protection level in the hierarchy is selected and the protection path calculation repeated. The process continues until a suitable protection path is identified.

摘要翻译： 通信网络包括下层传输层和结合有多个路由器的上覆盖层。 在各对路由器之间定义邻接关系。 通过定义网络覆盖的软件模型并在模型中定义主路径的保护级别的层次结构来提供路径保护。 每个保护级别的特征在于模型中的一个或多个断开的相邻集合的相应集合，根据底层拓扑的知识确定要被分解的邻接。 选择保护级别，并计算避免与该保护级别相关联的断开的邻接的保护路径。 如果这个计算的路径在实际网络中不可用，则选择层级中较低的保护级别，并重复保护路径计算。 该过程一直持续到确定合适的保护路径。