OATAO - Open Archive Toulouse Archive Ouverte Open Access Week

Worst-case Timing Analysis of Ring Networks with Cyclic Dependencies using Network Calculus

Amari, Ahmed and Mifdaoui, Ahlem Worst-case Timing Analysis of Ring Networks with Cyclic Dependencies using Network Calculus. (2017) In: the 23rd IEEE International Conference on Embedded and Real-Time Computing Systems and Applications - RTCSA 2017, 16 August 2017 - 18 August 2017 (Hsinchu, Taiwan, Province Of China). (Unpublished)

[img] (Document in English)

PDF (Author's version) - Depositor and staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
6MB

Abstract

The ring networks guarantee a high availability level, while limiting cabling costs. However, their performance analysis is still a relevant concern due to cyclic dependencies. In this paper, we handle this challenging issue based on Net- work Calculus formalism. We propose a new approach, Pay Multiplexing Only at Convergence points (PMOC), to compute accurate delay bounds while integrating the impact of cyclic dependencies. We first define and prove the end-to-end service curve, guaranteed for a flow of interest under Arbitrary multi- plexing. Afterwards, we detail the methodology of delay bounds computation and illustrate it in a special case of ring networks, called regular ring networks. Finally, we analyse the sensitivity and tightness of the derived delay bounds, and compare them against the related work results. We highlight a noticeable enhancement of delay bounds accuracy, thus network resource efficiency and scalability.

Item Type:Conference or Workshop Item (Paper)
Audience (conference):International conference proceedings
Uncontrolled Keywords:
Institution:Université de Toulouse > Institut Supérieur de l'Aéronautique et de l'Espace - ISAE-SUPAERO (FRANCE)
Laboratory name:
Statistics:download
Deposited By: ahlem mifdaoui
Deposited On:13 Jul 2017 13:52

Repository Staff Only: item control page