Patent ID: 6614762
Filing Date: 2003-09-02
Classification: H04L,H04Q

Abstract:
Method for computation of a restrictive cost between pairs of border nodes of a PNNI peer group, said peer group comprising nodes and links connecting two nodes, some of the nodes being border nodes, comprising the steps:1) maintaining a sorted list of such links sorted according to their cost, 2) assigning unique dominant identifiers to each one of said border nodes, and 3) taking such a link from said sorted list, a. if the link connects two nodes neither of which carries a dominant identifier, uniting the two sets of nodes of these two nodes by assigning an identifier to all nodes of the two sets, or b. if the link connects a node with a dominant identifier and a node which does not carry a dominant identifier, then uniting the two sets of nodes of these two nodes assigning a dominant identifier to all nodes of the two sets, or c. if the link connects a first node which carries a dominant identifier and a second node which carries a different dominant identifier, then updating the cost between the border node which belongs to the same set of nodes as the first node and the border node which belongs to the same set of nodes as the second node, and updating with the same cost all corresponding pairs of border nodes. d. continue with step 3) until the restrictive cost between all pairs of border nodes has been derived.