Method and apparatus for eliminating unprotectable paths from consideration during computation of a protectable shortest path tree
US6765880B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 18, 2000 |
| Grant date | Jul 20, 2004 |
| Priority date | — |
| Expiry date | Jan 18, 2020 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/22
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
The invention comprises a method for computing the shortest protectable paths in communication networks, and a method for establishing and defining protected paths. The invention utilizes a new algorithm to exclude from consideration as the “shortest path” between two network elements, a path for which adequate protection cannot be established. Such an unprotectable path will contain one or more unprotectable links. These unprotectable links can be identified and excluded based upon whether or not the link is a member of a loop. Because there are several more computational steps in defining the protected paths, after the shortest path has been found, the initial exclusion of unprotectable path segments from consideration eliminates the potential waste of computational resources leading to a more rapid and efficient routing and provisioning of reliable network paths and circuits.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.