Calculating the flow level performance of balanced fairness in tree networks

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.
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01272523
Contributor : Thomas Bonald <>
Submitted on : Thursday, February 11, 2016 - 7:50:24 AM
Last modification on : Wednesday, June 13, 2018 - 6:36:02 PM
Long-term archiving on : Saturday, November 12, 2016 - 4:54:52 PM

File

BF_in_tree_networks.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

96

Files downloads

154