Flooding Tree Optimization for Link State Protocol Scalability
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current link state protocol (LSP) message distribution techniques in networks are inefficient and redundant, limiting scalability due to the need for reliable flooding across all network nodes.
Innovation Solution
The method involves selecting a root flooding tree node with the lowest identifier value based on node connectivity, generating a flooding tree path using a shortest path first operation to efficiently distribute packets across the network, thereby reducing redundant link usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If LSP messages are distributed hop-by-hop to every adjacent neighbor node, then reliable flooding is achieved, but network scalability is limited due to inefficiency and redundancy
Solution Approach 1:
The patent segments the network into multiple regions, with each region having a designated region border router (RBR). LSP messages are flooded within each region independently rather than being propagated hop-by-hop across the entire network. This segmentation reduces redundant transmissions while maintaining reliable flooding within each region, thereby improving network scalability.
Solution Approach 2:
The patent introduces region border routers (RBRs) as intermediary nodes that receive LSP messages from their respective regions and forward them to other regions. This intermediary mechanism eliminates the need for every node to receive and retransmit messages to all neighbors, reducing overall network redundancy while preserving reliable flooding through the hierarchical RBR structure.
2Quantity of substance
If LSP messages are sent from every node to all adjacent neighbors, then complete network coverage is achieved, but redundant transmissions increase
Solution Approach 1:
By dividing the network into regions with designated RBRs, the patent ensures that LSP messages are transmitted only within each region and then propagated to other regions through RBRs. This eliminates redundant transmissions that would occur if every node transmitted to all neighbors, while still achieving complete network coverage through the hierarchical structure.
Solution Approach 2:
Instead of requiring every node to perform full flooding to all neighbors, the patent applies partial action by limiting message propagation to region boundaries through RBRs. This partial flooding approach achieves sufficient network coverage without the excessive redundant transmissions that would result from universal node-to-all-neighbors propagation.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Techniques are provided for generating efficient flooding tree paths in a network. At a node device in a network, a unicast message is sent to a plurality of node devices in the network. The node device obtains an identifier associated with each of the node devices in the network. The identifier contains information indicating node connectivity for each of the node devices. A selected node device is then identified. The selected node device is one of the node devices in the network that has a lowest identifier value indicating a lowest number of connected node devices to the selected node device in the network. The selected node device is classified as a root flooding tree node device. A flooding tree is generated by performing a shortest path first operation from the selected node device to the plurality of node devices in the network.