High performance LFA path algorithms
US9253079B2 · kind B2 · utility
1Cited by
1References
20Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Oct 11, 2013 |
| Grant date | Feb 2, 2016 |
| Priority date | — |
| Expiry date | Feb 7, 2034 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/28
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method is implemented by a network element to improve efficiency of loop free alternative (LFA) path computation by caching data from a shortest path first calculation for use in the LFA path calculation. The shortest path first calculation determines a shortest path from a source vertex to each vertex in a network topology graph representing the network in which the network element operates, where an endpoint for each shortest path is the shortest path vertex, and where each shortest path determined by the shortest path first calculation is stored.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.