IGP Flooding Topology for Scalable Link State Distribution
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
IGP networks experience scalability issues due to excessive link state message flooding, leading to increased signaling overhead and network traffic congestion as more nodes are added, which competes with data traffic for bandwidth.
Innovation Solution
Implement a flooding topology in IGP networks by generating a tree of links that connects nodes, allowing link state messages to be transmitted only over this subset topology, reducing redundant message traffic and maintaining network connectivity without broadcasting to all links.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If link state messages are broadcast to all nodes in the network, then all nodes receive complete link state information, but network traffic congestion increases and scalability deteriorates
Solution Approach 1:
The network is segmented into a flooding topology (tree structure) and non-flooding links. Link state messages are selectively flooded only through the topology tree, dividing the network into controlled segments rather than broadcasting to all nodes. This segmentation reduces redundant message transmission while maintaining complete link state information distribution to all nodes.
Solution Approach 2:
The flooding mechanism is extracted from the complete network graph and applied only to a specific subset forming a topology tree. By taking out only the necessary flooding paths (the tree structure) from the entire network, the patent eliminates redundant transmissions on non-tree links while preserving essential link state information propagation.
2Stability of the object's composition
If link state messages are broadcast to all nodes periodically, then all nodes maintain synchronized link state databases, but signaling overhead increases and competes with data traffic for bandwidth
Solution Approach 1:
The broadcast mechanism is segmented into targeted flooding along topology tree paths. Instead of periodic broadcasting to all nodes across all links, link state messages are flooded only through the segmented tree structure, reducing redundant transmissions and bandwidth consumption while maintaining database synchronization.
Solution Approach 2:
The patent replaces periodic broadcasting with event-driven flooding triggered by link state changes. When a node's link state changes, the message is flooded through the topology tree immediately rather than waiting for the next periodic broadcast cycle, reducing overall signaling overhead while maintaining synchronization.
3Productivity
If a flooding topology is implemented to reduce redundant message traffic, then network traffic congestion decreases, but the complexity of maintaining the topology increases
Solution Approach 1:
Each node independently calculates and maintains its own flooding topology based on received connectivity data, without requiring centralized topology distribution or complex coordination. This self-service approach reduces overall system complexity while achieving efficient flooding through the topology tree structure.
4Stability of the object's composition
If the flooding topology is transmitted to all nodes, then all nodes have consistent topology information, but additional network traffic is generated
Solution Approach 1:
Instead of transmitting the flooding topology to all nodes, each node independently creates a local copy of the topology by calculating it from received connectivity data. This copying approach ensures topology consistency across all nodes without generating additional transmission traffic for topology information.
Solution Approach 2:
Nodes self-generate their local flooding topology representations by processing connectivity data received during normal operation, eliminating the need for separate topology distribution messages and reducing overall network traffic.
Data Source
AI summary
Disclosed is a mechanism for implementing link state flooding reduction (LSFR) in an Interior Gateway Protocol (IGP) network. The mechanism includes receiving data indicating connectivity of a plurality of nodes in the network. A flooding topology is built based on the connectivity. This includes selecting one of the nodes as a root node, and building a tree of links connecting the root node to the nodes in the network. The flooding topology is stored in a memory. The flooding topology may not be to the remaining nodes in the network. Link state messages may then be flooded over the flooding topology.