METHOD AND APPARATUS OF CALCULATING MINIMUM TREE PATH, AND PROGRAM

摘要

PROBLEM TO BE SOLVED: To enable an MST path computation in an environment where a node with a multicast function and a node without it are mixed.

SOLUTION: A link stored in a storage means is classified into four in a predetermined order. The classification in the adoption priority of each link is set to a first priority, and a cost is set to a second priority. The link is adopted in descending order of adoption priority, and an initial tree is generated without considering the constraints of a unicast node. When the node X does not satisfy the constraints of the unicast node, the link of minimum cost in the unadopted link B including the node Y is selected with respect to the node Y on the tree connected to the node X with the link A, the link A is substituted by the link B, and the tree is outputted.

COPYRIGHT: (C)2006,JPO&NCIPI