公开(公告)号：US20110273983A1

公开(公告)日：2011-11-10

申请号：US13101870

申请日：2011-05-05

申请人： Davide Bergamasco ,  Andrea Baldini ,  Valentina Alaria ,  Flavio Bonomi ,  Rong Pan

发明人： Davide Bergamasco ,  Andrea Baldini ,  Valentina Alaria ,  Flavio Bonomi ,  Rong Pan

IPC分类号： H04L12/26

CPC分类号： H04L43/0882 ,  H04L43/062 ,  H04L47/10 ,  H04L47/11 ,  H04L47/263 ,  H04L47/30

摘要： The present invention provides improved methods and devices for managing network congestion. Preferred implementations of the invention allow congestion to be pushed from congestion points in the core of a network to reaction points, which may be edge devices, host devices or components thereof. Preferably, rate limiters shape individual flows of the reaction points that are causing congestion. Parameters of these rate limiters are preferably tuned based on feedback from congestion points, e.g., in the form of backward congestion notification (“BCN”) messages. In some implementations, such BCN messages include congestion change information and at least one instantaneous measure of congestion. The instantaneous measure(s) of congestion may be relative to a threshold of a particular queue and/or relative to a threshold of a buffer that includes a plurality of queues.

摘要翻译： 本发明提供了用于管理网络拥塞的改进的方法和设备。 本发明的优选实现允许将拥塞从网络核心中的拥塞点推送到可以是边缘设备，主机设备或其组件的反应点。 优选地，速率限制器形成引起堵塞的反应点的各个流。 这些速率限制器的参数优选地基于来自拥塞点的反馈来调整，例如以后向拥塞通知（“BCN”）消息的形式。 在一些实现中，这样的BCN消息包括拥塞变化信息和至少一个拥塞的瞬时测量。 拥塞的瞬时测量可以是相对于特定队列的阈值和/或相对于包括多个队列的缓冲器的阈值。

公开(公告)号：US08792352B2

公开(公告)日：2014-07-29

申请号：US13101870

申请日：2011-05-05

申请人： Davide Bergamasco ,  Andrea Baldini ,  Valentina Alaria ,  Flavio Bonomi ,  Rong Pan

发明人： Davide Bergamasco ,  Andrea Baldini ,  Valentina Alaria ,  Flavio Bonomi ,  Rong Pan

IPC分类号： H04J1/16

CPC分类号： H04L43/0882 ,  H04L43/062 ,  H04L47/10 ,  H04L47/11 ,  H04L47/263 ,  H04L47/30

摘要： The present invention provides improved methods and devices for managing network congestion. Preferred implementations of the invention allow congestion to be pushed from congestion points in the core of a network to reaction points, which may be edge devices, host devices or components thereof. Preferably, rate limiters shape individual flows of the reaction points that are causing congestion. Parameters of these rate limiters are preferably tuned based on feedback from congestion points, e.g., in the form of backward congestion notification (“BCN”) messages. In some implementations, such BCN messages include congestion change information and at least one instantaneous measure of congestion. The instantaneous measure(s) of congestion may be relative to a threshold of a particular queue and/or relative to a threshold of a buffer that includes a plurality of queues.

摘要翻译： 本发明提供了用于管理网络拥塞的改进的方法和设备。 本发明的优选实现允许将拥塞从网络核心中的拥塞点推送到可以是边缘设备，主机设备或其组件的反应点。 优选地，速率限制器形成引起堵塞的反应点的各个流。 这些速率限制器的参数优选地基于来自拥塞点的反馈来调整，例如以后向拥塞通知（“BCN”）消息的形式。 在一些实现中，这样的BCN消息包括拥塞变化信息和至少一个拥塞的瞬时测量。 拥塞的瞬时测量可以是相对于特定队列的阈值和/或相对于包括多个队列的缓冲器的阈值。

公开(公告)号：US07961621B2

公开(公告)日：2011-06-14

申请号：US11248933

申请日：2005-10-11

申请人： Davide Bergamasco ,  Andrea Baldini ,  Valentina Alaria ,  Flavio Bonomi ,  Rong Pan

发明人： Davide Bergamasco ,  Andrea Baldini ,  Valentina Alaria ,  Flavio Bonomi ,  Rong Pan

IPC分类号： H04J3/14

CPC分类号： H04L43/0882 ,  H04L43/062 ,  H04L47/10 ,  H04L47/11 ,  H04L47/263 ,  H04L47/30

摘要： The present invention provides improved methods and devices for managing network congestion. Preferred implementations of the invention allow congestion to be pushed from congestion points in the core of a network to reaction points, which may be edge devices, host devices or components thereof. Preferably, rate limiters shape individual flows of the reaction points that are causing congestion. Parameters of these rate limiters are preferably tuned based on feedback from congestion points, e.g., in the form of backward congestion notification (“BCN”) messages. In some implementations, such BCN messages include congestion change information and at least one instantaneous measure of congestion. The instantaneous measure(s) of congestion may be relative to a threshold of a particular queue and/or relative to a threshold of a buffer that includes a plurality of queues.

摘要翻译： 本发明提供了用于管理网络拥塞的改进的方法和设备。 本发明的优选实现允许将拥塞从网络核心中的拥塞点推送到可以是边缘设备，主机设备或其组件的反应点。 优选地，速率限制器形成引起堵塞的反应点的各个流。 这些速率限制器的参数优选地基于来自拥塞点的反馈来调整，例如以后向拥塞通知（“BCN”）消息的形式。 在一些实现中，这样的BCN消息包括拥塞变化信息和至少一个拥塞的瞬时测量。 拥塞的瞬时测量可以是相对于特定队列的阈值和/或相对于包括多个队列的缓冲器的阈值。

公开(公告)号：US20070081454A1

公开(公告)日：2007-04-12

申请号：US11248933

申请日：2005-10-11

申请人： Davide Bergamasco ,  Andrea Baldini ,  Valentina Alaria ,  Flavio Bonomi ,  Rong Pan

发明人： Davide Bergamasco ,  Andrea Baldini ,  Valentina Alaria ,  Flavio Bonomi ,  Rong Pan

IPC分类号： H04L12/26

CPC分类号： H04L43/0882 ,  H04L43/062 ,  H04L47/10 ,  H04L47/11 ,  H04L47/263 ,  H04L47/30

摘要： The present invention provides improved methods and devices for managing network congestion. Preferred implementations of the invention allow congestion to be pushed from congestion points in the core of a network to reaction points, which may be edge devices, host devices or components thereof. Preferably, rate limiters shape individual flows of the reaction points that are causing congestion. Parameters of these rate limiters are preferably tuned based on feedback from congestion points, e.g., in the form of backward congestion notification (“BCN”) messages. In some implementations, such BCN messages include congestion change information and at least one instantaneous measure of congestion. The instantaneous measure(s) of congestion may be relative to a threshold of a particular queue and/or relative to a threshold of a buffer that includes a plurality of queues.

摘要翻译： 本发明提供了用于管理网络拥塞的改进的方法和设备。 本发明的优选实现允许将拥塞从网络核心中的拥塞点推送到可以是边缘设备，主机设备或其组件的反应点。 优选地，速率限制器形成引起堵塞的反应点的各个流。 这些速率限制器的参数优选地基于来自拥塞点的反馈来调整，例如以后向拥塞通知（“BCN”）消息的形式。 在一些实现中，这样的BCN消息包括拥塞变化信息和至少一个拥塞的瞬时测量。 拥塞的瞬时测量可以是相对于特定队列的阈值和/或相对于包括多个队列的缓冲器的阈值。

公开(公告)号：US08005106B2

公开(公告)日：2011-08-23

申请号：US12469930

申请日：2009-05-21

申请人： Rong Pan ,  Ming Zhang ,  Chiara Piglione ,  Valentina Alaria

发明人： Rong Pan ,  Ming Zhang ,  Chiara Piglione ,  Valentina Alaria

IPC分类号： H04L12/54

CPC分类号： H04L49/9084 ,  H04L47/10 ,  H04L47/12 ,  H04L47/32 ,  H04L49/205 ,  H04L49/90

摘要： In one embodiment, apparatus and methods for apparatus and methods for fair bandwidth allocation are disclosed. In one embodiment, a method includes (i) determining a drop probability for each of a plurality of classes of packets being dropped or admitted to a queue, wherein each drop probability is based on a weighted fair bandwidth allocation process that is performed with respect to the plurality of classes and a plurality of packet arrival rates and predefined weights for such classes; and (ii) dropping a particular packet or admitting such particular packet to the queue based on the drop probability for such particular packet's class, wherein such dropping or admitting operation is further based on one or more drop precedence factors that are also determined periodically for each class if such one or more drop precedence factors are selected for such each class. In other embodiments, the invention pertains to an apparatus having one or more processors and one or more memory, wherein at least one of the processors and memory are adapted for performing the above described method operations.

摘要翻译： 在一个实施例中，公开了用于公平带宽分配的装置和方法的装置和方法。 在一个实施例中，一种方法包括（i）确定丢弃或允许进入队列的多个类别的分组中的每一个的丢弃概率，其中每个丢弃概率基于相对于 多个类别和多个分组到达速率和用于这些类别的预定权重; 并且（ii）丢弃特定分组或基于该特定分组的分类的丢弃概率来将该特定分组接纳到队列，其中这种丢弃或接纳操作还基于一个或多个丢弃优先级因子，其也为每个 如果为这样的每个类选择了一个或多个丢弃优先级因子，则该类别。 在其他实施例中，本发明涉及具有一个或多个处理器和一个或多个存储器的装置，其中处理器和存储器中的至少一个适于执行上述方法操作。

公开(公告)号：US20100296398A1

公开(公告)日：2010-11-25

申请号：US12469930

申请日：2009-05-21

申请人： Rong Pan ,  Ming Zhang ,  Chiara Piglione ,  Valentina Alaria

发明人： Rong Pan ,  Ming Zhang ,  Chiara Piglione ,  Valentina Alaria

IPC分类号： H04L12/56

CPC分类号： H04L49/9084 ,  H04L47/10 ,  H04L47/12 ,  H04L47/32 ,  H04L49/205 ,  H04L49/90

摘要： In one embodiment, apparatus and methods for apparatus and methods for fair bandwidth allocation are disclosed. In one embodiment, a method includes (i) determining a drop probability for each of a plurality of classes of packets being dropped or admitted to a queue, wherein each drop probability is based on a weighted fair bandwidth allocation process that is performed with respect to the plurality of classes and a plurality of packet arrival rates and predefined weights for such classes; and (ii) dropping a particular packet or admitting such particular packet to the queue based on the drop probability for such particular packet's class, wherein such dropping or admitting operation is further based on one or more drop precedence factors that are also determined periodically for each class if such one or more drop precedence factors are selected for such each class. In other embodiments, the invention pertains to an apparatus having one or more processors and one or more memory, wherein at least one of the processors and memory are adapted for performing the above described method operations.

摘要翻译： 在一个实施例中，公开了用于公平带宽分配的装置和方法的装置和方法。 在一个实施例中，一种方法包括（i）确定丢弃或允许进入队列的多个类别的分组中的每一个的丢弃概率，其中每个丢弃概率基于相对于 多个类别和多个分组到达速率和用于这些类别的预定权重; 并且（ii）丢弃特定分组或基于该特定分组的类别的丢弃概率将该特定分组接纳到该队列，其中这种丢弃或准入操作还基于一个或多个丢弃优先级因子，其也为每个 如果为这样的每个类选择了一个或多个丢弃优先级因子，则该类别。 在其他实施例中，本发明涉及具有一个或多个处理器和一个或多个存储器的装置，其中处理器和存储器中的至少一个适于执行上述方法操作。

公开(公告)号：US09391910B2

公开(公告)日：2016-07-12

申请号：US13554697

申请日：2012-07-20

申请人： Hiroshi Suzuki ,  Rong Pan ,  Flavio Bonomi ,  Ravi Prasad ,  Padma Akkiraju ,  Hariprasada R. Ginjpalli ,  Andrew Robbins

发明人： Hiroshi Suzuki ,  Rong Pan ,  Flavio Bonomi ,  Ravi Prasad ,  Padma Akkiraju ,  Hariprasada R. Ginjpalli ,  Andrew Robbins

IPC分类号： H04L12/56 ,  H04L12/825 ,  H04L12/933

CPC分类号： H04L47/266 ,  H04L49/15

摘要： Techniques for improving the performance of flow control mechanisms such as Pause are provided. The techniques provide for maintaining a fair distribution of available bandwidth while also allowing for fewer packet drops, and maximizing link utilization, in a distributed system. For example, in one embodiment, techniques are provided for achieving a fair share allocation of an egress port's bandwidth across a plurality of ingress ports contending for the same egress port.

摘要翻译： 提供了用于提高诸如暂停之类的流量控制机制的性能的技术。 这些技术提供了保持可用带宽的公平分配，同时还允许在分布式系统中更少的分组丢弃以及最大化链路利用率。 例如，在一个实施例中，提供了用于实现在竞争相同出口端口的多个入口端口上出口端口的带宽的公平共享分配的技术。

公开(公告)号：US07817556B2

公开(公告)日：2010-10-19

申请号：US11408293

申请日：2006-04-20

申请人： Rong Pan ,  Flavio Bonomi ,  George Varghese

发明人： Rong Pan ,  Flavio Bonomi ,  George Varghese

IPC分类号： G01R31/08

CPC分类号： H04L47/215 ,  H04L47/193 ,  H04L47/20

摘要： Various improvements are provided for prior art policing methods, including token bucket methods and virtual time policing methods. Some preferred methods of the invention involve assigning a non-zero drop probability even when the packet would otherwise have been transmitted according to a prior art policing method. For example, a non-zero drop probability may be assigned even when there are sufficient tokens in a token bucket to allow transmission of the packet. A non-zero drop probability may be assigned, for example, when a token bucket level is at or below a predetermined threshold or according to a rate at which a token bucket is being emptied. Some implementations involve treating a token bucket as a virtual queue wherein the number of free elements in the virtual queue is proportional to the number of remaining tokens in the token bucket. Such implementations may involve predicting a future virtual queue size according to a previous virtual queue size and using this predicted value to calculate a drop probability.

摘要翻译： 为现有技术的管理方法提供了各种改进，包括令牌桶方法和虚拟时间监管方法。 本发明的一些优选方法涉及分配非零丢弃概率，即使当根据现有技术的监管方法将分组以其他方式传输时也是如此。 例如，即使在令牌桶中有足够的令牌来允许分组的传输，也可以分配非零丢弃概率。 例如，当令牌桶级别等于或低于预定阈值时或者根据令牌桶被清空的速率时，可以分配非零丢弃概率。 一些实现涉及将令牌桶视为虚拟队列，其中虚拟队列中的空闲元素的数量与令牌桶中剩余令牌的数量成正比。 这样的实现可以涉及根据先前的虚拟队列大小预测未来的虚拟队列大小，并且使用该预测值来计算丢弃概率。

公开(公告)号：US20120047279A1

公开(公告)日：2012-02-23

申请号：US12861478

申请日：2010-08-23

申请人： Xiaoqing Zhu ,  Rong Pan ,  Vijaynarayanan Subramanian ,  Flavio Bonomi

发明人： Xiaoqing Zhu ,  Rong Pan ,  Vijaynarayanan Subramanian ,  Flavio Bonomi

IPC分类号： G06F15/16

CPC分类号： H04L47/33 ,  H04L47/11 ,  H04L47/18 ,  H04L47/19 ,  H04L47/326

摘要： Media-aware and TCP-compatible bandwidth sharing may be provided. In various embodiments, a network node may periodically update a virtual congestion level for a transmission stream in a network. The transmission stream may comprise at least one video stream and at least one data stream. The network node may then calculate, based at least in part on the virtual congestion level, a random packet marking probability or a random packet drop probability. In turn, the network node may either drop or mark transmission packets according to the calculated marking and dropping probability. The network node may further calculate an optimal video transmission rate for the at least one video stream and adjust a video transmission rate for the at least one video stream accordingly. Rate-distortions parameters for the at least one video stream may influence the optimal video transmission rate calculation for the at least one video stream.

摘要翻译： 可以提供媒体感知和TCP兼容带宽共享。 在各种实施例中，网络节点可以周期性地更新网络中的传输流的虚拟拥塞级别。 传输流可以包括至少一个视频流和至少一个数据流。 网络节点可以至少部分地基于虚拟拥塞级别来计算随机分组标记概率或随机分组丢弃概率。 反过来，网络节点可以根据计算的标记和丢弃概率来丢弃或标记传输分组。 所述网络节点还可以计算所述至少一个视频流的最佳视频传输速率，并相应地调整所述至少一个视频流的视频传输速率。 用于至少一个视频流的速率失真参数可影响至少一个视频流的最佳视频传输速率计算。

公开(公告)号：US20070248005A1

公开(公告)日：2007-10-25

申请号：US11408293

申请日：2006-04-20

申请人： Rong Pan ,  Flavio Bonomi ,  George Varghese

发明人： Rong Pan ,  Flavio Bonomi ,  George Varghese

IPC分类号： H04L12/26

CPC分类号： H04L47/215 ,  H04L47/193 ,  H04L47/20

摘要： Various improvements are provided for prior art policing methods, including token bucket methods and virtual time policing methods. Some preferred methods of the invention involve assigning a non-zero drop probability even when the packet would otherwise have been transmitted according to a prior art policing method. For example, a non-zero drop probability may be assigned even when there are sufficient tokens in a token bucket to allow transmission of the packet. A non-zero drop probability may be assigned, for example, when a token bucket level is at or below a predetermined threshold or according to a rate at which a token bucket is being emptied. Some implementations involve treating a token bucket as a virtual queue wherein the number of free elements in the virtual queue is proportional to the number of remaining tokens in the token bucket. Such implementations may involve predicting a future virtual queue size according to a previous virtual queue size and using this predicted value to calculate a drop probability.

摘要翻译： 为现有技术的管理方法提供了各种改进，包括令牌桶方法和虚拟时间监管方法。 本发明的一些优选方法涉及分配非零丢弃概率，即使当根据现有技术的监管方法将分组以其他方式传输时也是如此。 例如，即使在令牌桶中有足够的令牌来允许分组的传输，也可以分配非零丢弃概率。 例如，当令牌桶级别等于或低于预定阈值时或者根据令牌桶被清空的速率时，可以分配非零丢弃概率。 一些实现涉及将令牌桶视为虚拟队列，其中虚拟队列中的空闲元素的数量与令牌桶中剩余令牌的数量成正比。 这样的实现可以涉及根据先前的虚拟队列大小预测未来的虚拟队列大小，并且使用该预测值来计算丢弃概率。