Efficient identification of Q-space in remote LFA
US9444676B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 8, 2014 |
| Grant date | Sep 13, 2016 |
| Priority date | — |
| Expiry date | Jan 31, 2035 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/28
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method is implemented by a network device in a network having a plurality of nodes. The method computes a remote loop free alternative (RLFA) next hop as a backup for a primary path next hop. The method improves RLFA computation efficiency for a Q-Space list of nodes in a Q-space for an endpoint node by reducing calculations of the loop free condition for a path from a source node to a destination node via a tunnel between the source node and the endpoint node. The method includes adding a neighbor node to a poison list where the candidate node is in the poison list and the neighbor node is not in the candidate list, the poison list indicating that a node is not a candidate for Q-Space, and determining the Q-Space list by removing nodes from poison list from the plurality of nodes.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.