PNNI topology abstraction
US6614762B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 30, 1999 |
| Grant date | Sep 2, 2003 |
| Priority date | — |
| Expiry date | Jul 30, 2019 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L2012/5621
- WIPO fieldTelecommunications
- WIPO sectorElectrical engineering
Abstract
Scheme for the computation of a restrictive cost between pairs of border nodes of a PNNI peer group. A list of said links sorted according to their restrictive cost C is maintained. Logical sets of nodes are formed 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. Sets are united if 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. A Matrix update algorithm is applied if the link connects a node of a first set and a node of a second set that both already carry dominant unique identifiers.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.