On Light and Heavy Traffic Approximations of Balanced Fairness - Archive ouverte HAL Access content directly
Conference Papers Year :

On Light and Heavy Traffic Approximations of Balanced Fairness

(1, 2) , (3) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
BPV06.pdf (339.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01277612 , version 1 (22-02-2016)

Identifiers

  • HAL Id : hal-01277612 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More