Repair paths and loop-free alternate (LFA) calculation help maintain traffic flow during routing transitions. They reduce packet loss by precomputing alternate paths that can be used after a link or router failure.
Repair paths forward traffic while the network converges. When a link or router fails because of a physical-layer signal loss, only the adjacent routers detect the failure immediately. Other routers remain unaware until the routing protocol propagates the update, which can take several hundred milliseconds. During this interval, traffic must be redirected along an alternate path.
Summary
This process uses these components:
-
Adjacent router: Uses repair paths for packets that would otherwise traverse the failed link until routing convergence is complete.
-
Repair paths: Are precomputed so that the router can activate them as soon as it detects a failure.
Workflow
These stages describe the implementation of repair paths and LFA calculation.
- The LFA FRR feature uses specific repair paths to maintain connectivity:
- Equal-cost multipath (ECMP): Uses another member of an equal-cost path set as an alternate path when one link fails.
- Loop-free alternate (LFA): Acts a next hop that can reach the destination without sending the packet into a loop. Downstream paths are a subset of LFAs.
- IS-IS calculates LFAs based on RFC 5286, with modifications that optimize memory usage.
- IS-IS performs shortest path first (SPF) calculation for each neighbor.
- IS-IS evaluates prefixes for each result.
- IS-IS retains only the best repair path, so it does not need to store SPF results for all neighbors.
Result
After routing convergence completes, all routers update their forwarding information, and the failed link is removed from the routing computation.