Routing Node Selecting Routing Tables by Packet Characteristics
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing communication networks typically choose a single 'best' path for data packet routing without considering the specific delivery needs of different types of data, leading to inefficient traffic distribution across multiple possible paths.
Innovation Solution
A routing node with multiple routing tables, each corresponding to a specific cost function, selects the appropriate routing table based on data packet characteristics such as DiffServ code point, port number, or source-destination pair, allowing for dynamic path selection that balances traffic load across available paths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a single routing table is used for all data packets, then the routing system is simple and easy to manage, but network efficiency deteriorates because traffic cannot be distributed across multiple paths based on different delivery requirements
Solution Approach 1:
The routing table is segmented into multiple routing tables, each dedicated to specific traffic types or delivery requirements. This allows the routing system to select appropriate routing tables based on packet characteristics, enabling efficient traffic distribution across multiple paths while maintaining manageable complexity through organized segmentation
Solution Approach 2:
The routing system dynamically selects which routing table to use based on the specific requirements of each data packet (such as QoS parameters, traffic type, or destination). This dynamic selection allows the system to adapt to different delivery needs without requiring a complete redesign of the routing infrastructure
2Productivity
If multiple routing tables are implemented to handle different traffic types, then network efficiency improves through optimized path selection, but the complexity of managing multiple routing tables increases
Solution Approach 1:
Routing tables are pre-configured with specific path information for different traffic types before runtime. This preliminary action allows the routing node to quickly select appropriate paths without complex real-time calculations, improving traffic distribution efficiency while reducing the complexity of dynamic routing decisions
Solution Approach 2:
Each routing table is optimized for specific local requirements (such as low-latency paths for real-time traffic or high-bandwidth paths for bulk data transfer). This local quality approach allows efficient traffic distribution by matching packet characteristics with appropriate routing tables, while managing complexity through specialized rather than generalized routing logic
Data Source
Figure 1
Figure 2
Figure 3
AI summary
In one aspect, a method includes receiving a data packet at a routing node that includes a processor. The method also includes determining at least one value for the data packet, selecting a routing table from a plurality of routing tables stored at the routing node in response to the at least one value for the packet and forwarding the data packet in response to the routing table selected. Each routing table is associated with a respective one cost function.