Loop-Free Alternate Selection for Multi-Homed Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional link state routing protocols, such as OSPF and IS-IS, experience prolonged convergence times when a link or router fails, leading to delayed adaptation of forwarding tables, which adversely affects sensitive applications like VoIP and multimedia due to high traffic loss, with current failure detection and recovery times exceeding 50 milliseconds.
Innovation Solution
The implementation of pre-calculated loop-free alternate (LFA) next hops for forwarding network traffic, which involves determining candidate LFA next hops by evaluating specific cost inequalities between border routers and primary paths to provide local protection and reduce convergence times, allowing for immediate rerouting in case of failures.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional link state protocols re-compute shortest path algorithm upon link failure, then routing tables adapt to new topology, but convergence time increases to 500 milliseconds or more
Solution Approach 1:
The patent pre-calculates loop-free alternate next hops before link failures occur and installs them in the forwarding component. When a link failure happens, the router immediately switches to the pre-computed alternate path without waiting for shortest path re-computation, reducing convergence time from hundreds of milliseconds to under 50 milliseconds while ensuring loop-free routing.
2Loss of time
If alternate next-hop is pre-installed in forwarding component, then failure recovery time decreases below 50 milliseconds, but risk of routing loops may increase
Solution Approach 1:
The system performs preliminary validation during the alternate path selection process to ensure loop-free properties before installing in the forwarding component. The validation checks whether the alternate next hop provides genuine loop protection by verifying that traffic forwarded through the alternate path will not return to the original router, thus preventing routing loops while enabling fast convergence.
Solution Approach 2:
The patent implements feedback mechanisms where the router continuously monitors the state of alternate paths and validates whether they remain loop-free as network topology changes. This feedback ensures that pre-installed alternate next hops maintain their loop-free property even when other network links change state, providing ongoing reliability alongside fast convergence.
3Measurement precision
If multiple candidate LFA next hops are evaluated with cost inequalities, then loop-free alternate paths are accurately determined, but computational overhead increases
Solution Approach 1:
The patent applies partial evaluation by focusing computational effort only on the most promising candidate next hops rather than exhaustively evaluating all possible paths. The cost inequality checks are applied selectively to candidates that meet initial criteria, reducing the overall computational burden while maintaining high accuracy in selecting valid loop-free alternates.
Solution Approach 2:
The evaluation process is segmented into multiple stages: first filtering candidates based on basic topology criteria, then applying cost inequality checks only to the reduced set of promising candidates. This segmentation divides the computationally intensive task into manageable phases, reducing peak computational overhead while ensuring thorough validation of the final selected alternate path.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
In one example, a network device determines a set of candidate loop-free alternate (LFA) next hops for forwarding network traffic from the network device to a multi-homed network by taking into account a first cost associated with a second path from a first border router to the multi-homed network and a second cost associated with a second border router to the multi-homed network, wherein the multi-homed network is external to an interior routing domain in which the network device is located. The network device selects an LFA next hop from the set of candidate LFA next hops, to be stored as an alternate next hop for forwarding network traffic to the multi-homed network, and updates forwarding information stored by the network device to install the selected LFA next hop as the alternate next hop for forwarding network traffic from the network device to the multi-homed network.