Joint Frame Preemption and Credit-Based Shaping Scheduling for Real-Time Transmission

The Credit-Based Shaping (CBS) algorithm is a traffic scheduling technique commonly used in Time-Sensitive Networking (TSN) to manage audio and video streams. CBS is designed to solve the problem of continuous blocking of low-priority data streams caused by high-bandwidth data streams occupying communication resources for long durations. However, in certain application scenarios with stringent jitter requirements, CBS may fall short in meeting the demands of real-time control data streams. In this paper, we improve the CBS algorithm by introducing a frame preemption mechanism and propose a time-sensitive scheduling algorithm to ensure real-time transmission of critical traffic. Additionally, we conduct worst-case response time (WCRT) analysis of the proposed scheduling scheme under both preemptive and non-preemptive scenarios. Finally, we validated our design through a vehicular network scenario. The results indicate that this method not only resolves the real-time transmission issues of critical traffic but also reduces the overall traffic transmission delay.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Network and Service Management
Published
2024-11-27
DOI
https://doi.org/10.1109/tnsm.2024.3507181
Citations
1
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.35

Funders

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

Joint Frame Preemption and Credit-Based Shaping Scheduling for Real-Time Transmission

Yanli Xu, Zhou Kong
1 citations
IEEE Transactions on Network and Service Management
Scheduling and Optimization Algorithms
0.35
article

Joint Frame Preemption and Credit-Based Shaping Scheduling for Real-Time Transmission

Yanli Xu, Zhou Kong
article en
1 citations

Abstract

The Credit-Based Shaping (CBS) algorithm is a traffic scheduling technique commonly used in Time-Sensitive Networking (TSN) to manage audio and video streams. CBS is designed to solve the problem of continuous blocking of low-priority data streams caused by high-bandwidth data streams occupying communication resources for long durations. However, in certain application scenarios with stringent jitter requirements, CBS may fall short in meeting the demands of real-time control data streams. In this paper, we improve the CBS algorithm by introducing a frame preemption mechanism and propose a time-sensitive scheduling algorithm to ensure real-time transmission of critical traffic. Additionally, we conduct worst-case response time (WCRT) analysis of the proposed scheduling scheme under both preemptive and non-preemptive scenarios. Finally, we validated our design through a vehicular network scenario. The results indicate that this method not only resolves the real-time transmission issues of critical traffic but also reduces the overall traffic transmission delay.

IEEE Transactions on Network and Service ManagementVol. 22(2)
Shanghai Maritime University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 33%
Scheduling and Optimization Algorithms
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.

Joint Frame Preemption and Credit-Based Shaping Scheduling for Real-Time Transmission — Yanli Xu, Zhou Kong · IEEE Transactions on Network and Service Management (2024) | TGRS Research Map | TGRS