| 摘要 |
Scheme for the computation of a restrictive cost between pairs of border nodes of a PNNI peer group. The following steps are carried out to compute the restrictive cost: a.maintaining a sorted list of said links sorted according to their restrictive cost C, b.forming logical sets of nodes by taking one link after the other from said list starting with the cheapest cost C and assigning an identifier to the two nodes connected by the respective link, whereby the nodes of a set of nodes carry a dominant unique identifier if a border node is a member of the respective set, or a unique identifier if there is no border node being a member of the respective set, uniting two sets, if such a link connects a node of a first set and a node of a second set, by assigning a dominant unique identifier to all nodes of both sets if either nodes of the first or the nodes of the second set carry a dominant unique identifier, or by assigning a unique identifier to all nodes of both sets if neither the nodes of the first nor the nodes of the second set carry a dominant unique identifier, c. applying a matrix update algorithm if said link connects a node of a first set and a node of a second set that both already carry dominant unique identifiers. <IMAGE> |
