A Performance-Balanced Scheduling Algorithm for Diverse Real-World TSN Scenarios

Time-Sensitive Networking (TSN) achieves low-delay and low-jitter traffic transmission through different traffic scheduling mechanisms. However, despite numerous algorithms developed based on these mechanisms, most fail to concurrently support multipath, hybrid, and multicast traffic, which are prev...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on parallel and distributed systems Ročník 36; číslo 12; s. 2469 - 2481
Hlavní autori: Yang, Qian, Jiang, Xuyan, Liu, Rulin, Li, Tao, Yang, Hui, Quan, Wei, Sun, Zhigang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: IEEE 01.12.2025
Predmet:
audio video bridging traffic
Bandwidth
credit-based shaper
Delays
Heuristic algorithms
Job shop scheduling
Logic gates
Multicast algorithms
Routing
Scheduling
Scheduling algorithms
time-aware shaper
Time-sensitive networking (TSN)
time-triggered traffic
traffic routing and scheduling algorithm
Unicast
ISSN:1045-9219, 1558-2183
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Time-Sensitive Networking (TSN) achieves low-delay and low-jitter traffic transmission through different traffic scheduling mechanisms. However, despite numerous algorithms developed based on these mechanisms, most fail to concurrently support multipath, hybrid, and multicast traffic, which are prevalent in real-world scenarios. Moreover, balancing performance metrics such as success rate, bandwidth utilization, and computation overhead remains challenging for these algorithms, significantly limiting their application in diverse TSN scenarios. To solve this problem, this paper proposes a universal ultra-low-delay and zero-jitter traffic scheduling model. Based on this model, this paper further designs a performance-balanced algorithm. The algorithm improves traffic scheduling success rate through joint routing and scheduling, increases network bandwidth utilization through hybrid traffic scheduling, and achieves low computation overhead through policy-based searching. Finally, extensive experiments demonstrate that the algorithm effectively balances performance metrics across diverse real-world scenarios. It achieves high scheduling success rate under real-world traffic loads (<inline-formula><tex-math notation="LaTeX">> </tex-math> <mml:math><mml:mo>></mml:mo></mml:math><inline-graphic xlink:href="quan-ieq1-3580402.gif"/> </inline-formula>20% improvement over non-joint routing), increased bandwidth utilization in the presence of hybrid traffic (18.3% enhancement over non-hybrid traffic scheduling), and low computation overhead (<inline-formula><tex-math notation="LaTeX">< </tex-math> <mml:math><mml:mo><</mml:mo></mml:math><inline-graphic xlink:href="quan-ieq2-3580402.gif"/> </inline-formula> 2 minutes).
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2025.3580402