TSN Routing with Latency Tolerance Intervals
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing routing algorithms for time-sensitive networks (TSN) fail to effectively consider latency constraints of flows, leading to potential violations of latency requirements and complexity in scheduling, especially in dynamic and open systems like Industry 4.0 and 5G/6G core networks.
Innovation Solution
A method for routing data flows in deterministic TSN networks that takes into account the Qbv schedule and latency constraints by introducing a tolerance interval, allowing for more flexible time slot allocation and considering the load distribution across switches to minimize latency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If routing is computed along the shortest path in terms of number of hops, then routing complexity is reduced, but latency constraints of flows cannot be guaranteed
Solution Approach 1:
The patent changes the routing parameter from simple hop count to a composite metric that incorporates latency constraints and Qbv schedule information. The routing algorithm computes paths based on expected latency values derived from switch queue configurations and transmission schedules, ensuring that selected paths meet flow latency requirements while maintaining computational efficiency.
Solution Approach 2:
The patent performs preliminary computation of Qbv schedules and latency characteristics for all possible paths before actual routing decisions are made. By pre-calculating the latency implications of each path based on switch queue states and transmission schedules, the system enables fast routing lookups that guarantee latency constraints without real-time optimization complexity.
2Adaptability or versatility
If Qbv scheduling is configured without considering routing paths, then scheduling flexibility is improved, but latency requirements of flows cannot be met
Solution Approach 1:
The patent merges the routing and Qbv scheduling functions into a unified optimization process. The system simultaneously determines routing paths and configures Qbv transmission schedules by evaluating the combined impact of path selection and queue configuration on flow latency. This integrated approach ensures that scheduling decisions are made with full awareness of routing characteristics and vice versa.
Solution Approach 2:
The patent implements a feedback mechanism where the Qbv schedule configuration is used to compute expected latency for routing decisions, and routing path selections are used to validate and adjust schedule configurations. The system continuously monitors whether actual latencies meet constraints and adjusts both routing and scheduling parameters accordingly to maintain latency guarantees.
Data Source
AI summary
A method is provided for routing a data flow in a time-sensitive deterministic network, in order to route the packets of a data flow from a sender terminal to a receiver terminal, the network including switches for transmitting the packets, the switches being configured to implement predefined transmission scheduling over repeated time cycles having fixed-length time slots. The routing method uses the latency of a path as a metric to compute the k shortest paths between a sender terminal and a receiver terminal, and then, for each path, determines, for each switch located on this path, a tolerance interval that defines the amount of time for which the packets of a flow are able to wait at the switch before being transferred to the following switch, without exceeding the deadline for arrival of each packet of the flow at its destination, in order to reserve available slots.