A Joint Routing and Scheduling Algorithm with Load Balancing for CQF of Time-Sensitive Networking

Time-Sensitive Networking (TSN) is an enhancement to standard Ethernet that enables time-critical applications by providing deterministic guarantees on latency and jitter. One of the critical mechanisms in TSN is Cyclic Queuing and Forwarding (CQF), which simplifies the scheduling of time-triggered (TT) streams. However, efficient scheduling of TT streams under CQF remains a challenge since it has largely ignored the impact of routing, resulting in suboptimal scheduling performance. In addition, the joint routing scheduling of existing CQF research ignores the impact of load balancing on scheduling. In this paper, we propose a novel joint routing and scheduling algorithm, JRAS-CQF, that addresses the limitations of existing methods by considering a wider range of routing options and incorporating a route evaluation function that accounts for network hops and load balancing. Our simulation results demonstrate that JRAS-CQF achieves higher schedulability, improved resource utilization, and better load balancing than existing algorithms.

Authors

Institutions

Publication Details

Published
2025-06-27
DOI
https://doi.org/10.1109/iccci65070.2025.11158704
Primary Topic
Network Time Synchronization Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Joint Routing and Scheduling Algorithm with Load Balancing for CQF of Time-Sensitive Networking

Wei‐Ting Kuo, Ya-Ju Yu, Yuan‐Yao Shih, Ching-Chih Chuang
Network Time Synchronization Technologies
article

A Joint Routing and Scheduling Algorithm with Load Balancing for CQF of Time-Sensitive Networking

Wei‐Ting Kuo, Ya-Ju Yu, Yuan‐Yao Shih, Ching-Chih Chuang
article en

Abstract

Time-Sensitive Networking (TSN) is an enhancement to standard Ethernet that enables time-critical applications by providing deterministic guarantees on latency and jitter. One of the critical mechanisms in TSN is Cyclic Queuing and Forwarding (CQF), which simplifies the scheduling of time-triggered (TT) streams. However, efficient scheduling of TT streams under CQF remains a challenge since it has largely ignored the impact of routing, resulting in suboptimal scheduling performance. In addition, the joint routing scheduling of existing CQF research ignores the impact of load balancing on scheduling. In this paper, we propose a novel joint routing and scheduling algorithm, JRAS-CQF, that addresses the limitations of existing methods by considering a wider range of routing options and incorporating a route evaluation function that accounts for network hops and load balancing. Our simulation results demonstrate that JRAS-CQF achieves higher schedulability, improved resource utilization, and better load balancing than existing algorithms.

National Pingtung University (TW), National Chung Cheng University (TW), National University of Kaohsiung (TW)
Openalex Percentile: Top 71%
Network Time Synchronization Technologies
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.