Optimal routing for end-to-end guarantees using Network Calculus - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2008

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

Résumé

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.
Fichier principal
Vignette du fichier
RR-6423.pdf (275.33 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00214235 , version 1 (23-01-2008)
inria-00214235 , version 2 (24-01-2008)

Identifiants

  • HAL Id : inria-00214235 , version 2

Citer

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⟩
537 Consultations
533 Téléchargements

Partager

Gmail Facebook X LinkedIn More