OSSR: Online Scalable Scheduling and Routing for Industrial Time-Sensitive Networking

被引：0
作者：
Xu, Lei [1 ,2 ]
Xu, Qimin [1 ]
Zhang, Yanzhou [1 ]
Wang, Shouliang [1 ]
Chen, Cailian [1 ,3 ,4 ]
Guan, Xinping [1 ]
机构：
[1] Shanghai Jiao Tong Univ, Sch Elect Informat & Elect Engn, Shanghai 200240, Peoples R China
[2] Shanghai Jiao Tong Univ, Shanghai Key Lab Integrated Adm Technol Informat S, Shanghai 200240, Peoples R China
[3] Shanghai Jiao Tong Univ, Key Lab Syst Control & Informat Proc, Minist Educ China, Shanghai 200240, Peoples R China
[4] Shanghai Jiao Tong Univ, SJTU Paris Elite Inst Technol, Shanghai 200240, Peoples R China
来源：
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING | 2025年 / 12卷 / 03期
基金：
中国国家自然科学基金;
关键词：
Dynamic scheduling; Routing; Job shop scheduling; Scalability; Industrial Internet of Things; Measurement; Real-time systems; Iterative methods; Training; Ethernet; Time-sensitive networking (TSN); online scheduling; slot occupancy representation; scalable scheduling and routing;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
As the promising deterministic networking technology of Industrial Internet of Things (IIoT), Time-Sensitive Networking (TSN) has been widely investigated in recent years. Most existing research focuses on offline scheduling and routing for TSN, which is time-consuming and thus unsuitable for dynamic stream demands. To tackle this problem, an online scalable scheduling and routing (OSSR) scheme is proposed for TSN in this paper. A novel slot occupancy representation (SOR) model is established based on divisibility theory to transform the clique-based to a three-level tree-based mode in complex IIoT scenarios. This transformation reduces the computational complexity of maximum slot occupancy judgment from exponential to linear complexity. Based on the above SOR model, a load balance metric for stream scheduling is constructed to guide the optimal routing. Assessed by this metric, an online decoupled routing and scheduling algorithm is proposed to minimize the maximum slot occupancy of all links while guaranteeing high scalability. Evaluation results show that the proposed OSSR scheme outperforms the existing approaches with better adaption to dynamics and lower slot occupancy of links.
引用
收藏
页码：1761 / 1775
页数：15
相关论文
共 38 条
[1]   Incremental Path-Selection and Scheduling for Time-Sensitive Networks [J].
Alnajim, Abdullah ;
Salehi, Seyedmohammad ;
Shen, Chien-Chung .
2019 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2019,
[2]  
[Anonymous], 2016, IEEE Std 802. 1Qbv- 2015, P1, DOI [10.1109/IEEESTD.2016.8613095, DOI 10.1109/IEEESTD.2016.8613095]
[3]  
[Anonymous], 2022, IEC/IEEE Standard 60802
[4]  
[Anonymous], 2017, IEEE Std 802.1Qch-2017
[5]   Routing and Scheduling of Time-Triggered Traffic in Time-Sensitive Networks [J].
Atallah, Ayman A. ;
Hamad, Ghaith Bany ;
Mohamed, Otmane Ait .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2020, 16 (07) :4525-4534
[6]   DeepCQF: Making CQF Scheduling More Intelligent and Practicable [J].
Cheng, Zongrong ;
Yang, Dong ;
Zhang, Weiting ;
Ren, Jie ;
Wang, Hongchao ;
Zh, Hongke .
IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2022), 2022,
[7]   Scheduling Real-Time Communication in IEEE 802.1Qbv Time Sensitive Networks [J].
Craciunas, Silviu S. ;
Oliver, Ramon Serna ;
Chmelik, Martin ;
Steiner, Wilfried .
PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS PROCEEDINGS (RTNS 2016), 2016, :183-192
[8]   MSS: Exploiting Mapping Score for CQF Start Time Planning in Time-Sensitive Networking [J].
Guo, Miao ;
Gu, Chaojie ;
He, Shibo ;
Shi, Zhiguo ;
Chen, Jiming .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2023, 19 (02) :2140-2150
[9]  
Hagberg A.A., 2008, P 7 PYTH SCI C SCIPY
[10]  
Hong X., 2024, P IEEE INT JOINT C N, P1
1234