Skip to Main content Skip to Navigation
Conference papers

On Light and Heavy Traffic Approximations of Balanced Fairness

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 metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Thomas Bonald Connect in order to contact the contributor
Submitted on : Monday, February 22, 2016 - 6:46:44 PM
Last modification on : Friday, January 21, 2022 - 3:15:47 AM
Long-term archiving on: : Monday, May 23, 2016 - 3:02:04 PM


Files produced by the author(s)


  • HAL Id : hal-01277612, version 1



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



Les métriques sont temporairement indisponibles