Apparatus and method for finding a pair of disjoint paths in a communication network
US8345538B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 10, 2010 |
| Grant date | Jan 1, 2013 |
| Priority date | — |
| Expiry date | Aug 4, 2031 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04Q2011/0073
- WIPO fieldTelecommunications
- WIPO sectorElectrical engineering
Abstract
There is provided topology information including connection states among nodes in a network, and port information including restriction conditions on connectivity among ports within a restricted node. A path search apparatus finds a first path having the minimum total link-cost among a plurality of paths. The topology information is changed so that the first path is not searched for as a path having the minimum total link-cost among the plurality of paths, and the port information is changed based on a port connectivity change rule. Then, the path search apparatus finds a second path different from the first path, based on the changed port information and the changed topology information, and reconfigures a pair of link-disjoint paths satisfying the restriction conditions imposed on the restricted node, by removing a link shared by both the first and second paths from the original topology information.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.