On performance bounds for balanced fairness

Thomas Bonald 1, 2 Alexandre Proutière 2, 1
1 TREC - Theory of networks and communications
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt
Abstract : While Erlang's formula has helped engineers to dimension telephone networks for over eighty years, such a three-way " performance-demand-capacity " relationship is still lacking for data networks. It may be argued that the enduring success of Erlang's formula is essentially due to its simplicity: the call blocking rate does not depend on the distribution of call duration but on overall demand only. In this paper, we consider data networks and characterize those capacity allocations which have the same insensitivity property, in the sense that performance of data transfers does not depend on precise traffic characteristics such as the distribution of data volume but on overall demand only. We introduce the notion of " balanced fairness " and prove some key properties satisfied by this insensitive allocation. It is shown notably that the performance of balanced fairness is always better than that obtained if flows are transmitted in a " store and forward " fashion, allowing simple formula applying to the latter to be used as a conservative evaluation for network design and provisioning purposes.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01276419
Contributor : Thomas Bonald <>
Submitted on : Friday, February 19, 2016 - 12:48:09 PM
Last modification on : Friday, May 25, 2018 - 12:02:04 PM
Long-term archiving on : Friday, May 20, 2016 - 11:30:17 AM

File

peva.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Thomas Bonald, Alexandre Proutière. On performance bounds for balanced fairness. Performance Evaluation, Elsevier, 2004, ⟨10.1016/S0166-5316(03)00100-7⟩. ⟨hal-01276419⟩

Share

Metrics

Record views

310

Files downloads

238