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

公开(公告)号：US08149710B2

公开(公告)日：2012-04-03

申请号：US11825631

申请日：2007-07-05

申请人： Davide Bergamasco ,  Valentina Alaria ,  Chiara Piglione ,  Michele Caramello

发明人： Davide Bergamasco ,  Valentina Alaria ,  Chiara Piglione ,  Michele Caramello

IPC分类号： H04L12/26

CPC分类号： H04L47/30 ,  H04L47/29 ,  H04L49/90 ,  H04L49/9047

摘要： In one embodiment, a method comprises the following steps: receiving a first set of inputs comprising a first plurality of entities and a first traffic behavior; determining a first region of a buffer corresponding to the first traffic behavior; assigning the first plurality of entities to the first region; determining hierarchical relationships between at least some of the first plurality of entities; determining a first shared buffer space of the first region; and assigning at least one threshold for each of the first plurality of entities. The threshold may comprise a maximum amount of the first shared buffer space that may be allocated to an entity. The method may also involve configuring a logic device to allocate the first shared buffer space dynamically according to the hierarchical relationships and the thresholds.

摘要翻译： 在一个实施例中，一种方法包括以下步骤：接收包括第一多个实体和第一交通行为的第一组输入; 确定对应于所述第一交通行为的缓冲区的第一区域; 将所述第一多个实体分配给所述第一区域; 确定所述第一多个实体中的至少一些实体之间的分层关系; 确定所述第一区域的第一共享缓冲区空间; 以及为所述第一多个实体中的每一个分配至少一个阈值。 阈值可以包括可被分配给实体的第一共享缓冲区空间的最大量。 该方法还可以包括配置逻辑设备以根据分层关系和阈值动态地分配第一共享缓冲区空间。

公开(公告)号：US20090010162A1

公开(公告)日：2009-01-08

申请号：US11825631

申请日：2007-07-05

申请人： Davide Bergamasco ,  Valentina Alaria ,  Chiara Piglione ,  Michele Caramello

发明人： Davide Bergamasco ,  Valentina Alaria ,  Chiara Piglione ,  Michele Caramello

IPC分类号： H04J1/16

CPC分类号： H04L47/30 ,  H04L47/29 ,  H04L49/90 ,  H04L49/9047

摘要： In one embodiment, a method comprises the following steps: receiving a first set of inputs comprising a first plurality of entities and a first traffic behavior; determining a first region of a buffer corresponding to the first traffic behavior; assigning the first plurality of entities to the first region; determining hierarchical relationships between at least some of the first plurality of entities; determining a first shared buffer space of the first region; and assigning at least one threshold for each of the first plurality of entities. The threshold may comprise a maximum amount of the first shared buffer space that may be allocated to an entity. The method may also involve configuring a logic device to allocate the first shared buffer space dynamically according to the hierarchical relationships and the thresholds.

摘要翻译： 在一个实施例中，一种方法包括以下步骤：接收包括第一多个实体和第一交通行为的第一组输入; 确定对应于所述第一交通行为的缓冲区的第一区域; 将所述第一多个实体分配给所述第一区域; 确定所述第一多个实体中的至少一些实体之间的分层关系; 确定所述第一区域的第一共享缓冲区空间; 以及为所述第一多个实体中的每一个分配至少一个阈值。 阈值可以包括可被分配给实体的第一共享缓冲区空间的最大量。 该方法还可以包括配置逻辑设备以根据分层关系和阈值动态地分配第一共享缓冲区空间。

公开(公告)号：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计算相应的公平共享信息，并将公平共享信息发送到相应的入口码片。