发明授权
US06185698B2 Method and apparatus using ranking to select repair nodes in formation of a dynamic tree for multicast repair
失效
使用排序来选择修复节点以形成用于组播修复的动态树的方法和装置
- 专利标题: Method and apparatus using ranking to select repair nodes in formation of a dynamic tree for multicast repair
- 专利标题(中): 使用排序来选择修复节点以形成用于组播修复的动态树的方法和装置
-
申请号: US09063498申请日: 1998-04-20
-
公开(公告)号: US06185698B2公开(公告)日: 2001-02-06
- 发明人: 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
- 主分类号: G06F1100
- IPC分类号: G06F1100
摘要:
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.
信息查询