Optimal routing for end-to-end guarantees: the price of multiplexing - ENS de Lyon - École normale supérieure de Lyon Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2007

Optimal routing for end-to-end guarantees: the price of multiplexing

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. This work is supported by the ARC INRIA COINC.
Fichier principal
Vignette du fichier
rrlip2007-25.pdf (536.87 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

ensl-00151655 , version 1 (05-06-2007)

Identifiants

  • HAL Id : ensl-00151655 , version 1

Citer

Anne Bouillard, Bruno Gaujal, Sébastien Lagrange, Eric Thierry. Optimal routing for end-to-end guarantees: the price of multiplexing. 2007. ⟨ensl-00151655⟩
513 Consultations
263 Téléchargements

Partager

Gmail Facebook X LinkedIn More