Latency and Backlog Bounds in Time-Sensitive Networking with Credit Based Shapers and Asynchronous Traffic Shaping
Authors:
- Ehsan MohammadpourEMEhsan Mohammadpour
- Eleni StaiESEleni Stai
- Maaz MohiuddinMMMaaz Mohiuddin
- Jean-Yves Le BoudecJBJean-Yves Le Boudec
- 1 September 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 02, 1-6
Abstract
We compute bounds on end-to-end worst-case latency and on nodal backlog size for a per-class deterministic network that implements Credit Based Shaper (CBS) and Asynchronous Traffic Shaping (ATS), as proposed by the Time-Sensitive Networking (TSN) standardization group. ATS is an implementation of the Interleaved Regulator, which reshapes traffic in the network before admitting it into a CBS buffer, thus avoiding burstiness cascades. Due to the interleaved regulator, traffic is reshaped at every switch, which allows for the computation of explicit delay and backlog bounds. Furthermore, we obtain a novel, tight per-flow bound for the response time of CBS, when the input is regulated, which is smaller than existing network calculus bounds. We also compute a per-flow bound on the response time of the interleaved regulator. Based on all the above results, we compute bounds on the per-class backlogs. Then, we use the newly computed delay bounds along with recent results on interleaved regulators from literature to derive tight end-to-end latency bounds and show that these are less than the sums of per-switch delay bounds.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Timing Analysis of AVB Traffic in TSN Networks Using Network Calculus2018
- Urgency-Based Scheduler for Time-Sensitive Switched Ethernet Networks2016
- Analysis of Ethernet-Switch Traffic Shapers for In-Vehicle Networking Applications2015
- Complete modelling of AVB in Network Calculus Framework2014
- Exact Worst-case Delay for FIFO-multiplexing Tandems2012
- Tightening end to end delay upper bound for AFDX network calculus with rate latency FIFO servers using network calculus2008
- Delay jitter bounds and packet scale rate guarantee for expedited forwardingIEEE/ACM Transactions on Networking, 2002
- Delay Bounds in a Network with Aggregate Scheduling2000