Computational aspects of balanced fairness - Archive ouverte HAL Access content directly
Conference Papers Year : 2003

Computational aspects of balanced fairness


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

Dates and versions

hal-01281459 , version 1 (02-03-2016)



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⟩
259 View
86 Download



Gmail Facebook Twitter LinkedIn More