You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.
The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.
For the reports in this repository we specifically note that
- the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
- the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
- technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
- in other cases, please contact the copyright owner for detailed information
By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.
If you are in doubt, feel free to contact webmaster@ide.mdh.se
Efficient AVB-aware Scheduling for Critical Traffic in Time-sensitive Networks
Publication Type:
Conference/Workshop Paper
Venue:
32nd IEEE Real-Time and Embedded Technology and Applications Symposium
Abstract
Time-Sensitive Networking (TSN) enables deterministic mixed-criticality communication over standard Ethernet
through time-aware scheduling (IEEE 802.1Qbv) for Scheduled Traffic (ST) and via Credit-Based Shaping (CBS) for Audio-Video Bridging (AVB) traffic. Existing scheduling methods often prioritize ST schedules and require iterative feedback loops between ST-schedule generation and AVB schedulability analysis to ensure the timing of both classes. We propose a novel approach called EAST (Efficient AVB-aware Scheduling for TSN) that improves runtime and schedulability by introducing a constraint-driven approach that decouples AVB analysis from ST
schedule synthesis. We first perform a Worst-Case Response Time (WCRT) analysis to determine the maximum ST interference each AVB stream can tolerate without missing its deadline. This interference bound is then translated into temporal constraints on the ST scheduler, ensuring that both ST and AVB traffic remain schedulable without requiring multiple iterations of generating ST schedules and checking AVB schedulability. The resulting
formulation guarantees end-to-end latency bounds for both ST and AVB streams while drastically reducing schedule synthesis time. Synthetic and real-world test cases show that EAST reduces runtime by several orders of magnitude compared to prior methods, while maintaining or improving overall schedulability.
Bibtex
@inproceedings{Bujosa Mateu7358,
author = {Daniel Bujosa Mateu and Silviu Craciunas and Saad Mubeen},
title = {Efficient AVB-aware Scheduling for Critical Traffic in Time-sensitive Networks},
month = {May},
year = {2026},
booktitle = {32nd IEEE Real-Time and Embedded Technology and Applications Symposium},
url = {http://www.es.mdu.se/publications/7358-}
}