Spanning Tree Flooding Backbone for Link State Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current link state routing protocols face inefficiencies in flooding mechanisms, leading to network congestion and prolonged convergence times in large-scale networks, particularly due to the need for all nodes to rerun algorithms upon topology changes, which can result in widespread loss of topology database information and overload.
Innovation Solution
Implementing a spanning tree flooding backbone using Prim's algorithm to distribute topology information efficiently, where only links within the spanning tree are used for message propagation, and local nodes closest to failures dynamically repair the tree, minimizing the involvement of other nodes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If flooding mechanism is used to disseminate topology information in link state routed networks, then all nodes receive topology updates, but network congestion and control processor overload occur in large-scale networks
Solution Approach 1:
The patent segments the flooding process by introducing a two-phase approach: first, a spanning tree is constructed to identify a subset of nodes (root nodes) that will perform flooding; second, only these root nodes participate in the flooding process. This segmentation reduces the number of nodes involved in flooding from all network nodes to a manageable subset, preventing control processor overload while maintaining reliable topology information dissemination.
Solution Approach 2:
The patent introduces spanning tree root nodes as intermediary elements that mediate the flooding process. These root nodes act as intermediaries between the source of topology changes and the rest of the network, concentrating the flooding function in specific nodes rather than distributing it across all nodes. This intermediary approach reduces network congestion and control processor burden while ensuring topology updates reach all nodes.
2Reliability
If all nodes rerun spanning tree algorithm upon topology changes, then the flooding backbone is repaired, but widespread loss of topology database information and overload occur
Solution Approach 1:
The patent applies local quality by making the spanning tree repair process local rather than global. When a topology change occurs, only the root node whose spanning tree is affected needs to rerun the spanning tree algorithm, not all nodes in the network. This localized approach maintains flooding backbone integrity while preventing widespread information loss and overload that would result from global algorithm execution.
Solution Approach 2:
The patent implements preliminary action by maintaining the spanning tree structure in advance and designing it to be resilient to failures. The spanning tree is constructed beforehand with redundancy considerations, and failure detection mechanisms are pre-configured. When failures occur, the system can quickly repair the spanning tree locally without requiring all nodes to rerun the algorithm, thus preventing widespread information loss.
3Reliability
If traditional flooding is used in large flat mesh networks with hundreds of nodes, then topology information is distributed, but control processors become overwhelmed and convergence time increases to hundreds of seconds
Solution Approach 1:
The patent segments the flooding function by identifying and designating specific root nodes that will perform flooding operations. This segmentation reduces the number of nodes actively participating in flooding from hundreds to a manageable subset, enabling control processors to handle the load efficiently and achieving convergence in seconds rather than hundreds of seconds, while still distributing topology information reliably.
Solution Approach 2:
The patent implements self-service by enabling root nodes to autonomously perform flooding operations without requiring coordination or algorithm execution by all other nodes. The spanning tree structure is self-organizing, and root nodes independently manage flooding based on their position in the spanning tree, eliminating the need for global algorithm execution and dramatically reducing convergence time.
Data Source
AI summary
The present disclosure provides systems and methods for a spanning tree topology used as a spanning tree flooding topology for messages on a link state routed network. Specifically, messages are only broadcast on the links in the spanning tree flooding topology thereby significantly reducing message flooding. The present disclosure also provides systems and methods for automatically, correctly, and efficiently creating, reconfiguring, and fixing the spanning tree topology in the event of any spanning tree link failures.