| 摘要 |
FIELD: radio engineering, communication.SUBSTANCE: invention relates to a method for multicast route computation in a link state protocol controlled network. A spanning tree is computed from a first node in every other node in the network using a known spanning tree protocol. The network is then divided into two or more partitions, each partition encompassing an immediate neighbouring node of the first node and any nodes of the network subtending the neighbouring node on the spanning tree. Two or more of the partitions are merged when a predetermined criterion is satisfied. Nodes within all of the partitions except a largest one of the partitions are then identified, and each identified node is examined to identify node pairs for which a respective shortest path passes through the first node.EFFECT: high efficiency of multicast route computation.8 cl, 6 dwg |
