Backup Flooding Topology Paths for Split Network Recovery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network communication systems face challenges in quickly flooding link state (LS) to every node when a flooding topology is split due to link and/or node failures, which can lead to inefficiencies and delays in routing information distribution.
Innovation Solution
The implementation computes backup paths for critical links and nodes within the remaining flooding topology, enabling rapid LS flooding to all nodes even in the event of failures, by creating backup paths that reconnect split topologies and integrating these paths with the existing flooding topology to ensure resilience.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional flooding is used to distribute link state information, then all nodes receive the information, but the flooding process becomes slow and inefficient when topology splits occur
Solution Approach 1:
The system pre-computes backup paths for all links and nodes in the flooding topology before failures occur. When a failure happens, these pre-computed backup paths are immediately activated to reconnect split topologies, eliminating the need for slow on-demand path computation and enabling rapid LS flooding to all live nodes.
Solution Approach 2:
The flooding topology is segmented into critical links/nodes and non-critical ones. Backup paths are selectively computed and stored only for critical elements that would cause topology splits, while non-critical elements use standard flooding. This segmentation optimizes the balance between preparation overhead and failure response efficiency.
2Reliability
If backup paths are computed for all links and nodes, then network resilience is improved, but computational complexity increases
Solution Approach 1:
The system applies different treatment to different elements based on their criticality. Critical links and nodes have backup paths computed and stored, while non-critical elements do not. This local quality differentiation allows the system to achieve high resilience for essential components without the computational burden of preparing backup paths for all elements uniformly.
Solution Approach 2:
Instead of computing backup paths on-demand during failures, the system performs preliminary computation of backup paths for critical elements during normal operation. This shifts the computational work to off-peak times when the network is stable, reducing the complexity burden during failure events.
3Reliability
If the flooding topology is split due to link or node failures, then reachability is lost, but rapid reconnection is needed to maintain routing information distribution
Solution Approach 1:
Backup paths are pre-computed and stored for all critical links and nodes in the flooding topology. When a failure occurs, these pre-prepared paths are immediately activated to reconnect split topologies, eliminating the need for slow on-demand path computation and enabling rapid LS flooding to all live nodes.
Solution Approach 2:
The system creates copies of alternative paths (backup paths) for critical elements in advance. When failures occur, these copy paths are instantiated to restore reachability between split topology segments, providing immediate reconnection without waiting for original paths to be recomputed.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method for encoding messages of a flooding topology and backup paths of the flooding topology. The method includes monitoring a status of a network, and detecting at least one network failure. The network failure is one of a link failure, a node failure, or both. A backup path for each of the links and nodes on a flooding topology is computed. The backup paths for a link are encoded in a link backup path (LBP) data structure. The LBP data structure for the link is encoded in a LBP type-length-value (TLV). The encoded LBP-TLV comprising the encoded LBP data structure for the link is encoded in a backup paths opaque link state advertisement (LSA). The flooding topology is flooded with the backup paths opaque LSA.