Link State Packet Transmission in Tree Topology Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The flooding process in link state routing protocols leads to a large number of link state packets in the network, causing network bandwidth issues and broadcast storms that affect performance.
Innovation Solution
Implementing a method in a tree topology where intermediate and leaf routing nodes send link state packets to a root node for aggregation, reducing the number of packets transmitted and avoiding flooding by using distance vector information to determine the most efficient path for packet transmission.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the flooding process is used to transmit link state packets to all neighboring routers, then complete link state information can be obtained by all routers, but a large quantity of link state packets occupy network bandwidth and cause broadcast storms
Solution Approach 1:
The patent segments the network into a hierarchical tree structure with root nodes, intermediate nodes, and leaf nodes. Link state packets are transmitted selectively along tree edges rather than flooding to all neighbors, reducing packet quantity while maintaining information completeness through the hierarchical propagation path.
Solution Approach 2:
Different nodes in the hierarchy perform different functions: root nodes aggregate packets from all children, intermediate nodes forward packets upward and distribute aggregated packets downward, and leaf nodes send packets upward. This local differentiation optimizes the transmission process at each node to reduce overall packet quantity.
2Loss of information
If link state packets are flooded to all neighboring routers, then all routers can build complete link state databases, but network bandwidth is excessively occupied and network performance deteriorates
Solution Approach 1:
The network is segmented into hierarchical levels where information flows upward to root nodes for aggregation and then downward to all necessary nodes. This segmentation eliminates redundant transmissions across the entire network while ensuring each router receives the complete link state database through its designated path in the tree structure.
Solution Approach 2:
Root nodes merge (aggregate) link state packets from all child nodes into a comprehensive set. This combining process occurs once at the root rather than repeatedly at each intermediate node in traditional flooding, significantly reducing total packet transmissions while ensuring all routers receive the complete aggregated information.
3Ease of operation
If traditional flooding is used for link state packet transmission, then all routers receive packets from all neighbors, but the transmission process generates excessive packet overhead and causes broadcast storms
Solution Approach 1:
The patent introduces dynamic hierarchical roles (root, intermediate, leaf) that nodes can assume based on their position in the tree structure. This dynamic classification simplifies transmission rules at each node type while managing complexity through structured hierarchy rather than uniform flooding logic applied to all nodes.
Data Source
AI summary
A link state packet transmission method and a routing node are disclosed. The method is applied to a tree topology, where the tree topology includes a leaf routing node, an intermediate routing node, and a root routing node. The method includes: receiving, by the intermediate routing node, a link state packet sent by a child routing node of the intermediate routing node; sending, by the intermediate routing node, the link state packet to the root routing node, where the root routing node is configured to aggregate received link state packets to obtain a link state packet set; receiving, by the intermediate routing node, the link state packet set sent by the root routing node; and sending, by the intermediate routing node, the link state packet set to the child routing node of the intermediate routing node.