| 摘要 |
A method of preparing a group distribution graph for multicast transmission of a packet to a group of nodes in a computer network is disclosed. The method includes first preparing a spanning tree that includes every nodes in the computer network. A group distribution graph patterned after the spanning tree is then prepared by evaluating a node in the group distribution graph to determine whether the node is included in the group of nodes. If the node is not included in the group of nodes, and if the node has exactly one neighboring node, the node is removed from the group distribution graph. Likewise, if the node is not included in the group of nodes, and if the node has exactly two neighboring nodes, the node is removed from the group distribution graph by prescribing direct communication between the neighboring nodes, thus bypassing the removed node. In this manner, packet transmission and processing capacity of the network is more efficiently managed.
|
