Heuristic multiple paths computation for label switched paths
US10148551B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 30, 2016 |
| Grant date | Dec 4, 2018 |
| Priority date | — |
| Expiry date | Oct 29, 2036 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L47/24
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
In some examples, a path computation device is configured to compute, for a network of routers interconnected by a plurality of links in a network topology and based on a network topology model for the network topology, a first path that is a shortest path of the network topology model between a pair of nodes of the network topology model that represent a pair of the routers; increase, based on the first path, respective metrics for one or more links in the network topology model by respective finite values to obtain a modified network topology model; compute a second path that is a shortest path of the modified network topology model between the pair of nodes; and output data for at least one path of the first path and the second path to the network for programming a label switched path in the network on the at least one path.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.