公开(公告)号：US06185698B2

公开(公告)日：2001-02-06

申请号：US09063498

申请日：1998-04-20

申请人： Joseph Wesley ,  Stephen A. Hurst ,  Miriam C. Kadansky ,  Stephen R. Hanna ,  Philip M. Rosenzweig ,  Dah Ming Chiu ,  Radia J. Perlman

发明人： Joseph Wesley ,  Stephen A. Hurst ,  Miriam C. Kadansky ,  Stephen R. Hanna ,  Philip M. Rosenzweig ,  Dah Ming Chiu ,  Radia J. Perlman

IPC分类号： G06F1100

CPC分类号： H04L45/46 ,  H04L12/185 ,  H04L12/1863 ,  H04L45/04 ,  H04L45/16

摘要： An embodiment consistent with the present invention includes a method and apparatus for forming a multicast repair tree. The method may be performed by a data processor and comprises the steps of determining, for each of a plurality of potential heads in a multicast group, a ranking value associated with the potential head; advertising, by the potential heads to a plurality of potential receivers; prioritizing, by a potential receiver, the ranking values from the potential heads; and binding, by a potential receiver to the head having the highest ranking value, thereby forming a group of which the potential receiver is a member and the potential head is the head. The head may also be the sender. There may be a plurality of heads. The ranking values may include “able”, “unable”, “willing”, and “reluctant.” The ranking value of a potential head may be determined in accordance with a static or a dynamic configuration. Ranking values may be determined dynamically based on ranges of system resource levels such as memory and available processor resources.

摘要翻译： 与本发明一致的实施例包括用于形成多播修复树的方法和装置。 该方法可以由数据处理器执行，并且包括以下步骤：针对多播组中的多个潜在头中的每一者，确定与潜在头相关联的排序值; 广告，潜在的头到多个潜在的接收者; 由潜在的接收者优先考虑来自潜在负责人的排名值; 并且通过潜在的接收器将具有最高排序值的头绑定，从而形成潜在的接收器是一个成员的组，并且潜在头是头部。 头也可能是发件人。 可以有多个头。 排名值可能包括“能力”，“不能”，“愿意”和“不情愿”。 可以根据静态或动态配置来确定潜在头的排名值。 可以基于诸如存储器和可用处理器资源的系统资源级别的范围来动态地确定排名值。

公开(公告)号：US06757843B1

公开(公告)日：2004-06-29

申请号：US09698490

申请日：2000-10-26

申请人： Joseph Wesley ,  Stephen A. Hurst ,  Miriam C. Kadansky ,  Stephen R. Hanna ,  Philip M. Rosenzweig ,  Dah Ming Chiu ,  Radia J. Perlman

发明人： Joseph Wesley ,  Stephen A. Hurst ,  Miriam C. Kadansky ,  Stephen R. Hanna ,  Philip M. Rosenzweig ,  Dah Ming Chiu ,  Radia J. Perlman

IPC分类号： G06F1100

CPC分类号： H04L45/46 ,  H04L12/185 ,  H04L12/1863 ,  H04L45/04 ,  H04L45/16

摘要： An embodiment consistent with the present invention includes a method and apparatus for forming a multicast repair tree. The methods perform by a data processor and comprises the steps of determining, for each of a plurality of potential heads in a multicast group, a ranking value associated with the potential head; advertising, by the potential heads to a plurality of potential receivers; prioritizing, by a potential receiver, the ranking values from the potential heads; and binding, by a potential receiver to the head having the highest ranking value, thereby forming a group of which the potential receiver,is a member and the potential head is the head. The ranking values may include “able”, “unable”, “willing”, and “reluctant.” The ranking value of a potential head determines in accordance with a static or a dynamic configuration. Ranking values determine dynamically based on ranges of system resource levels such as memory and available processor resources.

摘要翻译： 与本发明一致的实施例包括用于形成多播修复树的方法和装置。 所述方法由数据处理器执行并且包括以下步骤：针对多播组中的多个潜在头中的每一者，确定与所述潜在头相关联的排序值; 广告，潜在的头到多个潜在的接收者; 由潜在的接收者优先考虑来自潜在负责人的排名值; 并且由潜在的接收器绑定到具有最高排名的头部，由此形成潜在的接收者是一个成员并且潜在的头部是头部的一组。 排名值可能包括“能力”，“不能”，“愿意”和“不情愿”。 潜在头的排名值根据静态或动态配置来确定。 排名值基于诸如存储器和可用处理器资源的系统资源级别的范围动态地确定。

公开(公告)号：US06427166B1

公开(公告)日：2002-07-30

申请号：US09668432

申请日：2000-09-22

申请人： Stephen A. Hurst ,  Joseph Wesley ,  Stephen R. Hanna ,  Miriam C. Kadansky ,  Philip M. Rosenzweig

发明人： Stephen A. Hurst ,  Joseph Wesley ,  Stephen R. Hanna ,  Miriam C. Kadansky ,  Philip M. Rosenzweig

IPC分类号： G06F1300

CPC分类号： H04L1/1867 ,  H04L12/185 ,  H04L12/1863 ,  H04L2001/0093 ,  H04L2001/0097

摘要： An embodiment consistent with the present invention includes a method and apparatus for distributing multicast data. The method may be performed by a data processor and comprises the steps of forming a multicast repair tree including a sender, a plurality of heads, and a plurality of receivers, wherein at least one head is associated with the sender and at least one receiver is associated with the head; sending, by a sender to the plurality of heads and the plurality of receivers, a plurality of multicast messages at a data rate; receiving, by the sender from one of the plurality of heads, a congestion status associated with a receiver of the head; and slowing the data rate, by the sender, in accordance with the congestion status.

摘要翻译： 与本发明一致的实施例包括用于分发多播数据的方法和装置。 该方法可以由数据处理器执行，并且包括以下步骤：形成包括发送器，多个头部和多个接收器的多播修复树，其中至少一个头部与发送器相关联，并且至少一个接收器是 与头相关; 发送方向所述多个头部和所述多个接收机发送数据速率的多个多播消息; 所述发送者从所述多个头中的一个接收与所述头部的接收器相关联的拥塞状态; 并根据拥塞状态，由发送方减慢数据速率。

公开(公告)号：US6151633A

公开(公告)日：2000-11-21

申请号：US63637

申请日：1998-04-20

申请人： Stephen A. Hurst ,  Joseph Wesley ,  Stephen R. Hanna ,  Miriam C. Kadansky ,  Philip M. Rosenzweig

发明人： Stephen A. Hurst ,  Joseph Wesley ,  Stephen R. Hanna ,  Miriam C. Kadansky ,  Philip M. Rosenzweig

IPC分类号： H04L12/18 ,  G06F13/00

CPC分类号： H04L1/1867 ,  H04L12/185 ,  H04L12/1863 ,  H04L2001/0093 ,  H04L2001/0097

摘要： An embodiment consistent with the present invention includes a method and apparatus for distributing multicast data. The method may be performed by a data processor and comprises the steps of forming a multicast repair tree including a sender, a plurality of heads, and a plurality of receivers, wherein at least one head is associated with the sender and at least one receiver is associated with the head; sending, by a sender to the plurality of heads and the plurality of receivers, a plurality of multicast messages at a data rate; receiving, by the sender from one of the plurality of heads, a congestion status associated with a receiver of the head; and slowing the data rate, by the sender, in accordance with the congestion status.