Computational aspects of balanced fairness

Thomas Bonald 1 Alexandre Proutière 2, 1 James Roberts 1 Jorma Virtamo 3
2 TREC - Theory of networks and communications
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt
Abstract : Flow level behaviour of data networks depends on the allocation of link capacities between competing flows. It has been recently shown that there exist allocations with the property that the stationary distribution of the number of flows in progress on different routes depends only on the traffic loads on these routes and is insensitive to any detailed traffic characteristics. Balanced fairness refers to the most efficient of such allocations. In this paper we develop a general recursive algorithm for efficiently calculating the corresponding performance metrics like flow throughput. Several examples are worked out using this algorithm including the practically interesting case of concentration tree networks .
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01281459
Contributor : Thomas Bonald <>
Submitted on : Wednesday, March 2, 2016 - 11:38:27 AM
Last modification on : Wednesday, June 13, 2018 - 6:36:02 PM
Long-term archiving on : Sunday, November 13, 2016 - 6:44:21 AM

File

itc18-bf.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Thomas Bonald, Alexandre Proutière, James Roberts, Jorma Virtamo. Computational aspects of balanced fairness. ITC18 18th International Teletraffic Congress, Aug 2003, Berlin, Germany. ⟨10.1016/S1388-3437(03)80229-9⟩. ⟨hal-01281459⟩

Share

Metrics

Record views

466

Files downloads

148