Optimal routing for end-to-end guarantees using Network Calculus - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2008

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

(1) , (2) , (3) , (4, 5)
1
2
3
4
5

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.
Fichier principal
Vignette du fichier
RR-6423.pdf (275.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : inria-00214235 , version 2

Cite

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⟩
515 View
499 Download

Share

Gmail Facebook Twitter LinkedIn More