Method and apparatus for selecting maximally disjoint shortest paths in a network
US7046634B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Apr 15, 2002 |
| Grant date | May 16, 2006 |
| Priority date | — |
| Expiry date | Jan 6, 2025 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/22
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method for selecting two maximally disjoint shortest paths between a source node and destination node in a network is provided. The method comprises determining a first explicit route between the source and destination nodes by using an original link cost for each link in the network, transforming the network by introducing conditional link costs, determining a second explicit route between the source and destination nodes in the transformed network taking into account the conditional link costs, and determining the two maximally disjoint shortest paths between the source and destination nodes by coalescing the first and second explicit routes. Beneficially, the step of introducing conditional link costs comprises adding additional parameters to links in the network and determining the conditional link costs depending on the position of each link relative to the first explicit route. Corresponding method for determining “N” maximally disjoint paths in a network, wherein “N” is equal or greater than two, is also provided.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.