On Light and Heavy Traffic Approximations of Balanced Fairness

Thomas Bonald 1, 2 Aleksi Penttinen 3 Jorma Virtamo 3
1 TREC - Theory of networks and communications
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt
Abstract : Flow level analysis of communication networks with multiple shared resources is generally difficult. A recently introduced sharing scheme called balanced fairness has brought these systems within the realm of tractability. While straightforward in principle, the numerical evaluation of practically interesting performance metrics like per-flow throughput is feasible for limited state spaces only, besides some specific networks where the results are explicit. In the present paper , we study the behaviour of balanced fairness in light and heavy traffic regimes and show how the corresponding performance results can be used to approximate the flow throughput over the whole load range. The results apply to any network, with a state space of arbitrary dimension. A few examples are explicitly worked out to illustrate the concepts.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-01277612
Contributor : Thomas Bonald <>
Submitted on : Monday, February 22, 2016 - 6:46:44 PM
Last modification on : Wednesday, June 13, 2018 - 6:36:02 PM
Long-term archiving on : Monday, May 23, 2016 - 3:02:04 PM

File

BPV06.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01277612, version 1

Collections

Citation

Thomas Bonald, Aleksi Penttinen, Jorma Virtamo. On Light and Heavy Traffic Approximations of Balanced Fairness. ACM Sigmetrics / Performance, 2006, Saint Malo, France. ⟨hal-01277612⟩

Share

Metrics

Record views

279

Files downloads

166