Method and apparatus for selecting between multiple equal cost paths
US8248925B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 7, 2009 |
| Grant date | Aug 21, 2012 |
| Priority date | — |
| Expiry date | Oct 21, 2030 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/66
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Each equal cost path is assigned a path ID created by concatenating an ordered set of link IDs which form the path through the network. The link IDs are created from the node IDs on either set of the link. The link IDs are sorted from lowest to highest when creating the path ID to facilitate ranking of the paths. The low and high ranked paths are selected from this ranked list as the first set of diverse paths through the network. Each of the link IDs on each of the paths is then renamed, for example by inverting either all of the high node IDs or low node IDs. After re-naming the links, new path IDs are created by concatenating an ordered set of renamed link IDs. The paths are then re-ranked and the low and high re-ranked paths are selected from this re-ranked list as the second set of diverse paths through the network. Selective naming of node IDs and use of different inversion functions can be exploited to further optimize distribution of traffic on the network.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.