QoS-Aware Routing Tables for Latency and Packet Loss
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional overlay networks do not consider quality of service (QoS) parameters such as latency, jitter, or packet loss rate in routing paths, leading to insufficient packet transmission performance.
Innovation Solution
A routing method that calculates paths based on dynamically measured QoS parameters using Dijkstra's algorithm, where each routing node reports QoS metrics to a control node, which determines optimal paths considering latency, packet loss rate, and jitter, and encapsulates packets with route type information for efficient forwarding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional IP-based routing is used in overlay networks, then routing simplicity is maintained, but QoS parameters such as latency, jitter, and packet loss rate are not considered
Solution Approach 1:
The patent segments the routing function into two parts: a control plane that calculates QoS-aware routing paths based on measured QoS parameters, and a forwarding plane that simply executes the predetermined routing decisions. This segmentation allows complex QoS routing logic to be centralized while keeping individual routing nodes simple.
Solution Approach 2:
The control node performs preliminary routing calculations by measuring QoS parameters and computing optimal routing paths in advance. The routing tables are pre-computed and distributed to routing nodes before actual data transmission, enabling forwarding nodes to make simple lookups rather than complex real-time decisions.
2Reliability
If QoS-aware routing paths are calculated dynamically, then packet transmission quality is improved, but measurement and control overhead increases
Solution Approach 1:
Each routing node autonomously measures QoS parameters for its outgoing interfaces and reports these measurements to the control node. This self-service approach distributes the measurement burden across the network rather than requiring centralized monitoring, reducing overall measurement overhead.
Solution Approach 2:
The system implements a feedback mechanism where routing nodes continuously measure QoS parameters and report them to the control node, which then recalculates routing paths based on the updated measurements. This closed-loop feedback enables adaptive routing that responds to changing network conditions while maintaining efficient use of measurement resources.
3Adaptability or versatility
If multiple routing tables are maintained for different QoS parameters, then routing flexibility is improved, but memory usage and processing time increase
Solution Approach 1:
The patent applies local quality by maintaining different routing tables for different QoS requirements (e.g., one routing table for latency-sensitive traffic, another for packet-loss-sensitive traffic). Each routing node stores multiple specialized routing tables, but only the appropriate table is activated based on the specific QoS requirements of the incoming packet, allowing efficient forwarding without processing all possible routing options.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A routing method and a device are disclosed, to provide a routing path that satisfies a QoS requirement. The routing method includes: performing QoS measurement on a path between the first routing node and a reachable adjacent routing node, to obtain a QoS parameter set of the path between every two adjacent routing nodes; reporting the QoS parameter set to the control node; receiving one or more routing tables of routing performed from the first routing node to the another routing node that are delivered by the control node; and receiving a packet, determining, from the one or more routing tables, a routing table corresponding to an identifier of the packet, and forwarding the received packet based on the routing table.