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

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.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Network Science and Engineering
Published
2025-02-05
DOI
https://doi.org/10.1109/tnse.2025.3538792
Citations
4
Primary Topic
Network Time Synchronization Technologies
Type
article
Field-Weighted Citation Impact
5.95

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Lei Xu, Qimin Xu, Cailian Chen, Shouliang Wang et al.
4 citations
IEEE Transactions on Network Science and Engineering
Network Time Synchronization Technologies
5.95
article

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

Lei Xu, Qimin Xu, Cailian Chen, Shouliang Wang, Yanzhou Zhang, Xinping Guan
article en
4 citations

Abstract

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.

IEEE Transactions on Network Science and EngineeringVol. 12(3)
Shanghai Jiao Tong University (CN)
National Natural Science Foundation of China
Industry, innovation and infrastructure
Openalex Percentile: Top 5%
Network Time Synchronization Technologies
5.95
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.