Traffic Scheduling with Injection Time Allocation in Time-Sensitive Networking

Time-Sensitive Networking (TSN) is an emerging technique which can provide deterministic service and real-time communication in Industrial Internet-of- Things (IIOT). Cyclic Queuing and Forwarding (CQF) mechanism in TSN is an efficient time-aware shaper to eliminate uncertain delay or jitter of transmissions. However, the deterministic requirements of IIOT are diverse and thus the traffic scheduling problems are always with high complexity. In this paper, we study the traffic scheduling problem with CQF mechanism and the goal is to maximize the total flows while satisfy the deterministic requirements of each flow. We propose an efficient algorithm to solve the traffic scheduling problem with CQF mechanism. Simulation results verify the effectiveness of the proposed algorithm compared to the benchmark schemes.

Authors

Institutions

Publication Details

Published
2024-11-27
DOI
https://doi.org/10.1109/mape62875.2024.10813909
Citations
1
Primary Topic
Network Time Synchronization Technologies
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Traffic Scheduling with Injection Time Allocation in Time-Sensitive Networking

Dongxu Li, Minghao Chen, Yang Zhang, Yuan Liu
1 citations
Network Time Synchronization Technologies
0.35
article

Traffic Scheduling with Injection Time Allocation in Time-Sensitive Networking

Dongxu Li, Minghao Chen, Yang Zhang, Yuan Liu
article en
1 citations

Abstract

Time-Sensitive Networking (TSN) is an emerging technique which can provide deterministic service and real-time communication in Industrial Internet-of- Things (IIOT). Cyclic Queuing and Forwarding (CQF) mechanism in TSN is an efficient time-aware shaper to eliminate uncertain delay or jitter of transmissions. However, the deterministic requirements of IIOT are diverse and thus the traffic scheduling problems are always with high complexity. In this paper, we study the traffic scheduling problem with CQF mechanism and the goal is to maximize the total flows while satisfy the deterministic requirements of each flow. We propose an efficient algorithm to solve the traffic scheduling problem with CQF mechanism. Simulation results verify the effectiveness of the proposed algorithm compared to the benchmark schemes.

China Southern Power Grid (China) (CN), South China University of Technology (CN)
Openalex Percentile: Top 35%
Network Time Synchronization Technologies
0.35
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.