Optimal routing for end-to-end guarantees using Network Calculus

Abstract : In this paper we show how Network Calculus can be used to compute the optimal route for a flow (w.r.t. end-to-end guarantees on the delay or the backlog) in a network in the presence of cross-traffic. When cross-traffic is independent, the computation is shown to boild down to a functional shortest path problem. When cross-traffic perturbates the main flow over more than one node, then the ``Pay Multiplexing Only Once'' phenomenon makes the computation more involved. We provide an efficient algorithm to compute the service curve available for the main flow and show how to adapt the shortest path algorithm in this case.
Liste complète des métadonnées

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/inria-00214235
Contributor : Rapport de Recherche Inria <>
Submitted on : Thursday, January 24, 2008 - 4:17:40 PM
Last modification on : Friday, January 4, 2019 - 5:32:56 PM
Document(s) archivé(s) le : Tuesday, September 21, 2010 - 3:39:48 PM

Files

RR-6423.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00214235, version 2

Citation

Anne Bouillard, Bruno Gaujal, Sébastien Lagrange, Eric Thierry. Optimal routing for end-to-end guarantees using Network Calculus. [Research Report] RR-6423, INRIA. 2008, pp.20. ⟨inria-00214235v2⟩

Share

Metrics

Record views

910

Files downloads

294