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

• 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.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences (hsv//eng)

Nyckelord

Real-time networks

Strict-priority traffic

TSN

Worst-case delay

Discrete event simulation

Interactive computer systems

Online systems

Topology

Bad-case delay

Delay bound

End to end

Periodic traffic

Real - Time system

Real time network

Traffic streams

Worst-case analysis

Real time systems

Publikations- och innehållstyp

ref (ämneskategori)

kon (ämneskategori)