公开(公告)号：US08817807B2

公开(公告)日：2014-08-26

申请号：US13493884

申请日：2012-06-11

申请人： Hiroshi Suzuki ,  Rong Pan ,  Flavio Bonomi ,  Chien Fang ,  Chiara Piglione

发明人： Hiroshi Suzuki ,  Rong Pan ,  Flavio Bonomi ,  Chien Fang ,  Chiara Piglione

IPC分类号： H04L12/54 ,  H04L12/56

CPC分类号： H04L12/54 ,  H04L49/1515 ,  H04L49/252 ,  H04L49/3027 ,  H04L49/552

摘要： An example method includes sending a virtual output queue (VOQ) length of a VOQ to an egress chip. The VOQ relates to a flow routed through an egress port associated with the egress chip. The method also includes receiving fair share information for the VOQ from the egress chip, and enforcing a control action on the incoming packets based on the fair share information. An ingress chip and the egress chip can be provided in a VOQ switch. The control action is a selected one of a group of actions, the group consisting of: (a) dropping packets, (b) pausing packets, and (c) marking packets. The method can further include receiving VOQ lengths of corresponding VOQs from respective ingress chips, where the VOQs relate to the flow. The method can also include calculating respective fair share information for each VOQ, and sending the fair share information to the respective ingress chips.

摘要翻译： 示例性方法包括向出口芯片发送VOQ的虚拟输出队列（VOQ）长度。 VOQ涉及通过与出口芯片相关联的出口端口路由的流。 该方法还包括从出口芯片接收VOQ的公平共享信息，并且基于公平共享信息对传入分组执行控制动作。 入口芯片和出口芯片可以提供在VOQ交换机中。 控制动作是一组动作中的一个选择的一组动作，该组由以下组成：（a）丢弃分组，（b）暂停分组，以及（c）标记分组。 该方法还可以包括从相应入口芯片接收相应VOQ的VOQ长度，其中VOQ与流程相关。 该方法还可以包括为每个VOQ计算相应的公平共享信息，并将公平共享信息发送到相应的入口码片。

公开(公告)号：US20130329577A1

公开(公告)日：2013-12-12

申请号：US13493884

申请日：2012-06-11

申请人： Hiroshi Suzuki ,  Rong Pan ,  Flavio Bonomi ,  Chien Fang ,  Chiara Piglione

发明人： Hiroshi Suzuki ,  Rong Pan ,  Flavio Bonomi ,  Chien Fang ,  Chiara Piglione

IPC分类号： H04L12/26 ,  H04L12/56

CPC分类号： H04L12/54 ,  H04L49/1515 ,  H04L49/252 ,  H04L49/3027 ,  H04L49/552

摘要： An example method includes sending a virtual output queue (VOQ) length of a VOQ to an egress chip. The VOQ relates to a flow routed through an egress port associated with the egress chip. The method also includes receiving fair share information for the VOQ from the egress chip, and enforcing a control action on the incoming packets based on the fair share information. An ingress chip and the egress chip can be provided in a VOQ switch. The control action is a selected one of a group of actions, the group consisting of: (a) dropping packets, (b) pausing packets, and (c) marking packets. The method can further include receiving VOQ lengths of corresponding VOQs from respective ingress chips, where the VOQs relate to the flow. The method can also include calculating respective fair share information for each VOQ, and sending the fair share information to the respective ingress chips.

摘要翻译： 示例性方法包括向出口芯片发送VOQ的虚拟输出队列（VOQ）长度。 VOQ涉及通过与出口芯片相关联的出口端口路由的流。 该方法还包括从出口芯片接收VOQ的公平共享信息，并且基于公平共享信息对传入分组执行控制动作。 入口芯片和出口芯片可以提供在VOQ交换机中。 控制动作是一组动作中的一个选择的一组动作，该组由以下组成：（a）丢弃分组，（b）暂停分组，以及（c）标记分组。 该方法还可以包括从相应入口芯片接收相应VOQ的VOQ长度，其中VOQ与流程相关。 该方法还可以包括为每个VOQ计算相应的公平共享信息，并将公平共享信息发送到相应的入口码片。

公开(公告)号：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.

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

公开(公告)号：US20140022901A1

公开(公告)日：2014-01-23

申请号：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

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.

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

公开(公告)号：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）丢弃特定分组或基于该特定分组的分类的丢弃概率来将该特定分组接纳到队列，其中这种丢弃或接纳操作还基于一个或多个丢弃优先级因子，其也为每个 如果为这样的每个类选择了一个或多个丢弃优先级因子，则该类别。 在其他实施例中，本发明涉及具有一个或多个处理器和一个或多个存储器的装置，其中处理器和存储器中的至少一个适于执行上述方法操作。

公开(公告)号：US20110194426A1

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

申请号：US12702826

申请日：2010-02-09

申请人： Chien FANG ,  Hiroshi Suzuki ,  Rong Pan ,  Abhijit Kumar Choudhury ,  David Sheldon Stephenson ,  Surendra Anubolu ,  Hariprasad R. Ginjpalli ,  Stanley WaiYip Ho ,  Peter Geoffrey Jones

发明人： Chien FANG ,  Hiroshi Suzuki ,  Rong Pan ,  Abhijit Kumar Choudhury ,  David Sheldon Stephenson ,  Surendra Anubolu ,  Hariprasad R. Ginjpalli ,  Stanley WaiYip Ho ,  Peter Geoffrey Jones

IPC分类号： H04L12/56

CPC分类号： H04L47/20 ,  H04L47/32 ,  H04L47/52 ,  H04L47/60 ,  H04L49/90

摘要： In an example embodiment, there is disclosed herein logic encoded in at least one tangible media for execution and when executed operable to receive a packet. The logic determines a client associated with the packet. The client associated with a service set, and the service set associated with a transmitter. The logic determines a drop probability for the selected client determines a current packet arrival rate for the selected client and determines whether to enqueue or drop the packet based on the drop probability for the selected client and the current packet arrival rate associated with the selected client. The drop probability is based on a packet arrival rate and virtual queue length for the, which is based on a packet arrival rate and virtual queue length for the service set that is based on a packet arrival rate and virtual queue length for the transmitter.

摘要翻译： 在一个示例性实施例中，本文公开了逻辑编码在至少一个有形介质中用于执行，并且当被执行时可操作以接收分组。 逻辑确定与数据包相关联的客户端。 与服务集相关联的客户端以及与发射机相关联的服务集合。 该逻辑确定所选择的客户端的丢弃概率确定所选择的客户端的当前分组到达速率，并且基于所选客户端的丢弃概率以及与所选择的客户端相关联的当前分组到达速率，确定是否对分组进行入队或丢弃。 丢弃概率基于分组到达速率和虚拟队列长度，其基于基于分组到达速率和发射机的虚拟队列长度的服务集合的分组到达速率和虚拟队列长度。

公开(公告)号：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）丢弃特定分组或基于该特定分组的类别的丢弃概率将该特定分组接纳到该队列，其中这种丢弃或准入操作还基于一个或多个丢弃优先级因子，其也为每个 如果为这样的每个类选择了一个或多个丢弃优先级因子，则该类别。 在其他实施例中，本发明涉及具有一个或多个处理器和一个或多个存储器的装置，其中处理器和存储器中的至少一个适于执行上述方法操作。

公开(公告)号：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消息包括拥塞变化信息和至少一个拥塞的瞬时测量。 拥塞的瞬时测量可以是相对于特定队列的阈值和/或相对于包括多个队列的缓冲器的阈值。

公开(公告)号：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.

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