Aggregated Routing Information for Network Segment Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing routing information sending methods, such as routing flooding in communication technologies, face inefficiencies due to the need to send large amounts of routing information across areas, leading to prolonged times and low flooding efficiency.
Innovation Solution
A method where a first node in a network aggregates routing information from multiple nodes within a network segment sharing the same flexible algorithm, and sends this aggregated information to a second area, reducing the amount of data needed to be sent and improving efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If each node in the first area sends routing information to the second area individually, then routing information completeness is improved, but the amount of routing information sent increases and flooding efficiency deteriorates
Solution Approach 1:
The patent merges routing information from multiple nodes in the first area into a single aggregated routing information structure. Specifically, it combines the algorithm identifier and network segment identifier into one unified routing information entry that represents multiple nodes, thereby reducing the total amount of routing information sent to the second area while maintaining completeness.
Solution Approach 2:
The aggregated routing information serves multiple functions simultaneously: it represents multiple nodes (N nodes in the network segment), carries algorithm identification, and provides network segment identification. This multi-functional design allows a single routing information entry to replace what would otherwise require multiple separate entries.
2Quantity of substance
If routing information is aggregated from multiple nodes, then the amount of routing information sent is reduced, but the complexity of aggregation processing increases
Solution Approach 1:
The patent changes the parameter representation by introducing a network segment identifier that groups multiple nodes. Instead of sending individual node identifiers, the system uses the network segment identifier to represent a group of N nodes, thereby reducing the quantity of routing information while the aggregation logic handles the complexity of mapping multiple nodes to their segment.
3Loss of time
If aggregated routing information is sent to the second area, then flooding time is reduced, but the requirement for flexible algorithm identification increases
Solution Approach 1:
The patent performs preliminary aggregation of routing information in the first area before sending to the second area. By pre-combining the algorithm identifier with the network segment identifier, the system prepares the routing information in advance, reducing the time required for flooding in the second area while maintaining the ability to identify and handle different flexible algorithms.
Data Source
AI summary
A method is applied to a network comprising a first area and a second area. A first node in the first area obtains aggregated routing information, where the aggregated routing information is obtained by aggregating a plurality of pieces of original routing information, the plurality of pieces of original routing information correspond to N nodes in a network segment, the N nodes in the network segment have a same flexible algorithm flex-algo, and the aggregated routing information carries an algorithm identifier used to indicate the flex-algo and a network segment identifier used to indicate the network segment. The first node sends the aggregated routing information to the second area, where the aggregated routing information is used to indicate a node in the second area to send a packet to the N nodes in the network segment based on the aggregated routing information.