Remote LFA Next Hops for Node Protection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional link state routing protocols like OSPF and IS-IS take too long to adapt to network failures, leading to significant delays in convergence and potential packet loss, which is detrimental for VoIP and multimedia applications.
Innovation Solution
The implementation of pre-calculated remote loop-free alternate next hops to provide local protection for network traffic, allowing for faster convergence by using pre-computed path segments and potential repair tunnels to ensure node protection and reduce computational overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional link state routing protocols (OSPF, IS-IS) are used for routing, then routing information is disseminated and topology is maintained, but convergence time is too long (500ms to several seconds) causing packet loss
Solution Approach 1:
The patent pre-calculates and stores remote loop-free alternate (LFA) next hops and path segments before failures occur. When a failure is detected, these pre-computed alternates are immediately activated without waiting for full convergence, reducing recovery time from seconds to milliseconds and preventing packet loss during the transition.
Solution Approach 2:
The patent introduces remote LFA next hops as intermediary nodes that provide alternative paths through repair tunnels. These intermediaries allow traffic to bypass failed links and nodes while the routing protocol converges, effectively mediating between the failed primary path and the updated topology.
2Speed
If pre-calculated remote LFA next hops are implemented, then convergence speed is improved and packet loss reduced, but computational overhead and complexity increase
Solution Approach 1:
The patent performs the computationally intensive SPF computations and LFA calculations in advance, during normal operation when network resources are abundant. This preliminary computation stores ready-to-use alternate paths that can be instantly activated during failures, trading off normal-time computational resources for failure-time speed.
Solution Approach 2:
The patent extracts the complex convergence computation from the failure response process itself and separates it into a preliminary preparation phase. By taking out the heavy computational work and performing it beforehand, the failure response becomes a simple lookup and activation of pre-computed alternates, dramatically reducing the computational burden during critical failure events.
3Reliability
If remote LFA next hops are used for fast convergence, then packet loss is reduced, but the complexity of identifying and validating candidate alternates increases
Solution Approach 1:
The patent replaces complex dynamic validation mechanisms with static pre-validation of candidate LFA next hops. During normal operation, the system pre-identifies and validates candidates using SPF computations and loop-free alternate criteria. During failures, this pre-validation eliminates the need for complex real-time validation, simplifying the failure response while maintaining reliability.
Solution Approach 2:
The patent creates copies of validated path segments and LFA candidate information and stores them in advance. When failures occur, these pre-copied validated paths can be directly activated without re-validation, reducing both complexity and time while ensuring packet delivery reliability through the use of pre-verified alternate paths.
Data Source
AI summary
An example method includes selecting, by a network device, a remote LFA next hop as an alternate next hop for forwarding network traffic from the network device to a destination, wherein the selected remote LFA next hop provides node protection to a primary next hop node on the shortest path from the network device to the destination. The method includes, for each candidate remote LFA next hop, performing a forward shortest path first (SPF) computation having the respective candidate remote LFA next hop as a root to compute a path segment between the respective candidate remote LFA next hop and the destination, wherein each of the candidate remote LFA next hops is the egress of a respective potential repair tunnel between the network device and candidate remote LFA next hop, and selecting the remote LFA next hop based at least in part on the computed path segments.