Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.inria.fr/hal-01885874
Contributor : Anne Bouillard <>
Submitted on : Friday, October 5, 2018 - 11:29:53 AM
Last modification on : Wednesday, December 9, 2020 - 3:10:24 PM
Long-term archiving on: : Sunday, January 6, 2019 - 12:55:34 PM

Files

cycles_report.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01885874, version 1
  • ARXIV : 1810.02623

Citation

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

Share

Metrics

Record views

97

Files downloads

96