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

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

Authors:

Nitin Desai, Radu Dobrin, Sasikumar Punnekkat

Research group:

Dependable Software Engineering

Publication Type:

Conference/Workshop Paper

Venue:

28th International Conference on Emerging Technologies and Factory Automation

DOI:

10.1109/ETFA54631.2023.10275348

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.

Bibtex

@inproceedings{Desai6860,
author = {Nitin Desai and Radu Dobrin and Sasikumar Punnekkat},
title = {A Topology-specific Tight Worst-case Analysis of Strict Priority Traffic in Real-time Systems},
editor = {IEEE},
booktitle = {28th International Conference on Emerging Technologies and Factory Automation},
url = {http://www.es.mdu.se/publications/6860-}
}