Best-effort networks: modeling and performance analysis via large networks asymptotics

Abstract : In this paper we introduce a class of Markov models, termed best-effort networks, designed to capture performance indices such as mean transfer times in data networks with best-effort service. We introduce the so-called min bandwidth sharing policy as a conservative approximation to the classical max-min policy. We establish necessary and sufficient ergodicity conditions for best-effort networks under the min policy. We then resort to the mean field technique of statistical physics to analyze network performance deriving fixed point equations for the stationary distribution of large symmetrical best-effort networks. A specific instance of such net- works is the star-shaped network which constitutes a plausible model of a network with an overprovisioned backbone. Numerical and analytical study of the equations allows us to state a number of qualitative conclusions on the impact of traffic parameters (link loads) and topology parameters (route lengths) on mean document transfer time.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-00718187
Contributor : Jean-Marc Lasgouttes <>
Submitted on : Monday, July 16, 2012 - 2:16:25 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on : Wednesday, October 17, 2012 - 2:40:15 AM

Files

min-infocom.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Guy Fayolle, Arnaud de la Fortelle, Jean-Marc Lasgouttes, Laurent Massoulié, James Roberts. Best-effort networks: modeling and performance analysis via large networks asymptotics. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM 2001, Apr 2001, Anchorage, United States. pp.709-716, ⟨10.1109/INFCOM.2001.916259⟩. ⟨hal-00718187⟩

Share

Metrics

Record views

214

Files downloads

146