Implementation Cost Comparison of TSN Traffic Control Mechanisms

Pruski, Aleksander; Yomsi, Patrick Meumeu; Berger, Michael; Almeida, Luís

doi:10.1109/etfa45728.2021.9613463

Cited by 9 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Grigorjew et al [7] proposed an asynchronous shaping mechanism with a fixed delay by combining CBS with ATS mechanisms. Pruski et al [8] conducted a comprehensive cost comparison of various TSN traffic control mechanisms to assist designers in selecting the most suitable shaping solution for their specific requirements. Hasan et al [9] [10] [11] with the end-to-end goal, theoretical delay analysis, and optimization of the guard band have been conducted.…”

Section: Introductionmentioning

confidence: 99%

An improved credit-based shaper for TSN

Li,

Liu,

Gong

et al. 2024

Third International Conference on Algorithms, Microchips, and Network Applications (AMNA 2024)

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

An improved credit-based shaper for TSN

Li,

Liu,

Gong

et al. 2024

Third International Conference on Algorithms, Microchips, and Network Applications (AMNA 2024)

View full text Add to dashboard Cite

“…and (2) how to proceed with the ow-to-preemption-class mapping? In response to these concerns, it is worth noting that while Ethernet can support at most a seven-level preemption scheme 2 , each additional preemption level comes with signi cant hardware overheads that can increase the cost of switch manufacturing [33,39]. To ensure an optimal use of hardware resources, the system designer must ensure that just the needed number of preemption levels are supported for the transmission of ows over the network.…”

Section: Introductionmentioning

confidence: 99%

A Configuration Framework for Multi-level Preemption Schemes in Time Sensitive Networking

Yomsi

Almeida

2022

Proceedings of the 30th International Conference on Real-Time Networks and Systems

View full text Add to dashboard Cite

To reduce the latency of time-sensitive flows in Ethernet networks, the IEEE TSN Task Group introduced the IEEE 802.1Qbu Standard, which specifies a 1-level preemption scheme for IEEE 802.1 networks. Recently, serious limitations of this scheme w.r.t. flows responsiveness were exposed and the so-called multi-level preemption approach was proposed to address these drawbacks. As is the case with most, if not all, real-time and/or timesensitive preemptive systems, an appropriate priority-to-flow assignment policy plays a central role in the resulting performance of both 1-level and multi-level preemption schemes to avoid the over-provisioning and/or the suboptimal use of hardware resources. Yet on another front, the multi-level preemption scheme raises new configuration challenges. Specifically, the right number of preemption level(s) to enable for swift transmission of flows; and the flow-to-preemption-class assignment synthesis remain open problems. To the best of our knowledge, there is no prior work in the literature addressing these important challenges. In this work, we address these three challenges. We demonstrate the applicability of our proposed solution by using both synthetic and real-life use-cases. Our experimental results show that multi-level preemption schemes improve the schedulability of flows by over 12% as compared to a 1-level preemption scheme, and at a higher abstraction level, the proposed configuration framework improves the schedulability of flows by up to 6% as compared to the dominant Deadline Monotonic Priority Ordering.

show abstract