LSP Flooding Groups for Dense Network Overflooding Control
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In dense topologies, interior gateway protocol (IGP) flooding mechanisms designed for sparse networks overflood due to the generation of multiple identical copies of information, leading to slower convergence times and higher resource utilization.
Innovation Solution
Implementing a method for network devices to receive a modified link state protocol (LSP) data unit, determine algorithm compatibility, calculate a shortest-path spanning tree (SPT), and truncate it to two hops to form a flooding group, selecting a member to flood the data unit while preventing redundant copies across the network.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional IGP flooding mechanisms are used in dense topologies, then network coverage is achieved, but overflooding occurs generating multiple identical copies of information
Solution Approach 1:
The patent segments the flooding process by introducing flooding groups that divide the network into smaller manageable units. Each flooding group is formed by truncating the SPT to a specific number of hops, creating distinct groups of nodes that will receive and forward LSP data units. This segmentation prevents overflooding by ensuring that only nodes within the same flooding group receive duplicate information, while maintaining comprehensive network coverage through proper group formation.
Solution Approach 2:
The patent applies local quality by making each network device determine its own flooding group membership based on its position in the SPT. Each device calculates which flooding group it belongs to by counting hops from the originator, and only forwards LSP data units to devices in the same group. This local determination mechanism ensures that flooding behavior is optimized for each device's specific position in the network, preventing overflooding while maintaining coverage.
2Reliability
If multiple identical copies of information are generated for network coverage, then all nodes receive data, but convergence time increases
Solution Approach 1:
By segmenting the network into flooding groups based on hop distance from the LSP originator, the patent reduces the number of redundant copies that need to be processed. Instead of generating copies for all nodes in the network, only nodes within the same flooding group receive duplicates, significantly reducing processing time and accelerating convergence while maintaining necessary network coverage.
3Loss of information
If traditional flooding mechanisms are used, then information is distributed, but computing and networking resources are consumed
Solution Approach 1:
The patent segments the flooding process into manageable groups, where each network device only processes and forwards LSP data units within its designated flooding group. This segmentation dramatically reduces the computational burden by limiting the scope of information processing to relevant nodes only, thereby conserving computing and networking resources while maintaining effective information distribution.
Solution Approach 2:
Each network device determines its own flooding group membership locally based on its position in the SPT, enabling distributed decision-making without requiring extensive resource consumption. The local determination of flooding group membership allows devices to process information efficiently based on their specific network position, reducing overall resource utilization while maintaining comprehensive information distribution.
4Object-generated harmful factors
If flood reduction algorithms are implemented, then redundant copies are reduced, but algorithm migration between devices becomes complex
Solution Approach 1:
The patent implements universality by designing a unified flooding group formation mechanism that works across different flood reduction algorithms. The common SPT truncation approach to two hops provides a universal method for determining flooding groups that can be applied regardless of which specific flood reduction algorithm each device uses, simplifying multi-algorithm support and device migration while effectively reducing redundant copies.
Data Source
AI summary
A first network device of a first tier of a network may receive a modified link state protocol (LSP) data unit, and may determine, based on the modified LSP data unit, whether an origin of the modified LSP data unit is executing the same algorithm as the first network device. The first network device may calculate a shortest-path spanning tree (SPT), and may set metrics to one for links associated with the first network device and the plurality of other network devices based on determining that the origin of the modified LSP data unit is executing a different algorithm than the first network device. The first network device may truncate the SPT to determine a flooding group, may select a member of the flooding group to flood the modified LSP data unit, and may cause the member to provide the modified LSP data unit to a second tier network device.