Flow ordering problem for time-triggered traffic in the scheduling of Time-Sensitive Networking

Time-Sensitive Networking (TSN) can ensure deterministic communications for time-critical traffic, which plays a crucial role in various real-time scenarios. In this letter, we propose and study a neglected problem in TSN, named flow ordering problem, which provides a new perspective on improving th...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2023-05, Vol.27 (5), p.1-1
Main Authors: Chen, Zhuoxing, Lu, Yiqin, Wang, Haihan, Qin, Jiancheng, Wang, Meng
Format: Article
Language:English
Subjects:
Communications traffic
Costs
Deterministic communications
Genetic algorithms
Job shop scheduling
Mathematical models
Metaheuristics
NP-hard
Schedules
Scheduling
Scheduling algorithms
Search algorithms
Time-Sensitive Networking (TSN)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Time-Sensitive Networking (TSN) can ensure deterministic communications for time-critical traffic, which plays a crucial role in various real-time scenarios. In this letter, we propose and study a neglected problem in TSN, named flow ordering problem, which provides a new perspective on improving the scheduling of large-scale TSN. Specifically, we formulate the flow ordering problem, look into its theoretical basis, and prove this problem is NP-hard. Furthermore, we propose a hybrid search algorithm to provide an optimized scheduling order. Simulation results verify the significant impact of the flow ordering problem on TSN scheduling and the effectiveness of our algorithm.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2023.3252626