Calculating the flow level performance of balanced fairness in tree networks - Archive ouverte HAL Access content directly
Journal Articles Performance Evaluation Year : 2004

Calculating the flow level performance of balanced fairness in tree networks

(1) , (2)
1
2
Thomas Bonald

Abstract

We consider a tree network whose resources are shared by a dynamically varying number of elastic flows. We present an efficient method for calculating performance metrics such as flow throughputs when the resource allocation is balanced fair. The method is based on a recursive algorithm for computing the normalization constant of the stationary distribution. Several examples are worked out. A proof is given for the Pareto efficiency of balanced fairness in tree networks.
Fichier principal
Vignette du fichier
BF_in_tree_networks.pdf (243.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01272523 , version 1 (11-02-2016)

Identifiers

Cite

Thomas Bonald, Jorma Virtamo. Calculating the flow level performance of balanced fairness in tree networks. Performance Evaluation, 2004, ⟨10.1016/j.peva.2004.03.001⟩. ⟨hal-01272523⟩
46 View
107 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More