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

@inproceedings{Bouillard2007OptimalRF,
  title={Optimal routing for end-to-end guarantees: the price of multiplexing},
  author={Anne Bouillard and Bruno Gaujal and Sebastien Lagrange and Eric Thierry},
  booktitle={VALUETOOLS},
  year={2007}
}
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… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Network Calculus: A Theory of Deterministic Queuing Systems for the Internet, volume

  • J.-Y. Le Boudec, P. Thiran
  • 2001
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…