Stability and performance guarantees in networks with cyclic dependencies - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2018

Stability and performance guarantees in networks with cyclic dependencies

Abstract

With the development of real-time networks such as reactive embedded systems, there is a need to compute deterministic performance bounds. This paper focuses on the performance guarantees and stability conditions in networks with cyclic dependencies in the network calculus framework. We first propose an algorithm that computes tight backlog bounds in tree networks for any set of flows crossing a server. Then, we show how this algorithm can be applied to improve bounds from the literature fir any topology, including cyclic networks. In particular, we show that the ring is stable in the network calculus framework.
Fichier principal
Vignette du fichier
cycles_report.pdf (401.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01885874 , version 1 (05-10-2018)

Identifiers

Cite

Anne Bouillard. Stability and performance guarantees in networks with cyclic dependencies. 2018. ⟨hal-01885874⟩
89 View
90 Download

Altmetric

Share

Gmail Facebook X LinkedIn More