Loop-Free Alternate Path Advertising for Network Repair
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network repair methods, such as those described in Shand et al, require significant computational burden for SPF calculations and notvia address computations, which can be optimized by identifying and advertising loop-free alternate paths to reduce unnecessary computations and prevent looping in data communications networks.
Innovation Solution
The method involves identifying and advertising loop-free alternate (LFA) paths in the network, allowing nodes to skip notvia address calculations and reduce computational requirements by forwarding packets directly through LFA paths, thereby minimizing the need for incremental SPF calculations and notvia address computations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If notvia address computations and incremental SPF calculations are performed for all network components, then network repair capability is provided, but computational overhead and processing time increase significantly
Solution Approach 1:
The patent applies preliminary action by pre-calculating and advertising loop-free alternate (LFA) paths before failures occur. Nodes compute and store backup next-hop information in advance using a simplified algorithm that identifies nodes satisfying loop-free conditions, rather than performing complex incremental SPF calculations when failures occur. This allows rapid failover while reducing computational burden during normal operation and failure recovery.
Solution Approach 2:
The patent extracts the essential requirement for loop-free repair paths by identifying and advertising only the critical LFA properties (nodes that satisfy loop-free conditions) rather than computing complete incremental SPF trees for all possible failures. This extraction approach captures the necessary repair capability while eliminating unnecessary computational overhead associated with full SPF recalculations.
2Productivity
If standard link state routing protocols are used, then optimal routing paths are determined, but looping can occur during network changes and routing transactions
Solution Approach 1:
The patent applies preliminary anti-action by pre-identifying and advertising loop-free alternate paths before looping conditions can occur. When a failure is detected, traffic is immediately redirected along pre-computed LFA paths that are guaranteed to be loop-free, preventing the looping problem that would otherwise occur during routing database desynchronization and LSP propagation delays.
Solution Approach 2:
The patent introduces LFA path advertising as an intermediary mechanism between standard link state routing and loop-free repair. The LFA advertisement system acts as a mediator that provides pre-computed safe paths, allowing nodes to bypass the looping vulnerability inherent in standard link state protocols during transient states without requiring complete protocol redesign.
3Reliability
If loop-free alternate paths are advertised for all possible failures, then comprehensive network protection is achieved, but message size and information overhead increase
Solution Approach 1:
The patent applies local quality by advertising LFA information locally and selectively rather than globally for all possible failures. Each node advertises LFA paths only for its directly connected neighbors and local repair capabilities, rather than propagating complete failure scenario information throughout the entire network. This localized approach provides comprehensive protection while minimizing message size and information overhead.
Data Source
AI summary
A method of advertising repair capability in a network repair scheme using network repair addresses for repairing around a repairable network component in a data communications network having, as components, nodes and links therebetween, comprises establishing whether an alternate repair path is available around a repairable component. If such a repair path is available, the method further comprises issuing a corresponding notification to nodes in the network.