| 摘要 |
<p>PROBLEM TO BE SOLVED: To provide a high-speed and high-reliability method for calculating a complex node representation. SOLUTION: In order to calculate a restrictive cost between a pair of boundary nodes in a PNNI equal group, a list sorted according to a restrictive cost C of a link is maintained (a). Then, the links are provided successively from the lowest cost C in the logic set of nodes, identifiers are allocated to respective two connected nodes, and the node in the set carries any controlling unique identifier in the case that the boundary nodes are the elements of the set but carriers the unique identifier in the other case, and when the nodes in the first and second sets are connected through the link, in the case that any one of these nodes carries the controlling unique identifier, the controlling unique identifier is allocated to all the nodes in both the sets but in the other case, the unique identifier is allocated to all the nodes in both the groups so that two sets are merged (b). When the said link is to connect the nodes of the first and second sets already carrying the controlling unique identifier and a matrix update algorithm is applied (c).</p> |
