A Topology-specific Tight Worst-case Analysis of Strict Priority Traffic in Real-time Systems | IEEE Conference Publication | IEEE Xplore

A Topology-specific Tight Worst-case Analysis of Strict Priority Traffic in Real-time Systems


Abstract:

Tight end-to-end worst-case delay bounds for periodic traffic streams are essential for time sensitive networks. In this paper, we provide an algorithm to compute a tight...Show More

Abstract:

Tight end-to-end worst-case delay bounds for periodic traffic streams are essential for time sensitive networks. In this paper, we provide an algorithm to compute a tight (and accurate) end-to-end worst-case bound by considering distinct topological patterns and the manner in which streams enter and leave switches. This refined analysis uses non-preemptive, strict-priority arbitration mechanism commonly deployed in Ethernet switches. Compared to the state-of-the-art that considers all higher and equal priority interference as contributing to the worst-case bound, we present an analytical approach for computing a tighter worst-case delay bound and prove through discrete event simulations that only a certain number of equal-priority interference streams can actually affect the worst-case case. Our results enable efficient resource allocation and have implications for online re-configuration mechanisms for time-sensitive factory communication systems.
Date of Conference: 12-15 September 2023
Date Added to IEEE Xplore: 12 October 2023
ISBN Information:

ISSN Information:

Conference Location: Sinaia, Romania

References

References is not available for this document.