Optimal routing for end-to-end guarantees: the price of multiplexing
Anne Bouillard, Bruno Gaujal, Sébastien Lagrange, Éric Thierry · 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