Calculating the flow level performance of balanced fairness in tree networks

T. Bonald; J. Virtamo

doi:10.1016/j.peva.2004.03.001

Calculating the flow level performance of balanced fairness in tree networks

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	1-14
Number of pages	14
Journal	Performance Evaluation
Volume	58
Issue number	1
DOIs	https://doi.org/10.1016/j.peva.2004.03.001
Publication status	Published - 1 Jan 2004
Externally published	Yes

Keywords

Balanced fairness
Flow throughput
Recursion for normalization constant
Tree network

Access to Document

10.1016/j.peva.2004.03.001

Cite this

@article{95409bd8d3064030be901de9f84778f5,

title = "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.",

keywords = "Balanced fairness, Flow throughput, Recursion for normalization constant, Tree network",

author = "T. Bonald and J. Virtamo",

year = "2004",

month = jan,

day = "1",

doi = "10.1016/j.peva.2004.03.001",

language = "English",

volume = "58",

pages = "1--14",

journal = "Performance Evaluation",

issn = "0166-5316",

number = "1",

}

TY - JOUR

T1 - Calculating the flow level performance of balanced fairness in tree networks

AU - Bonald, T.

AU - Virtamo, J.

PY - 2004/1/1

Y1 - 2004/1/1

N2 - 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.

AB - 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.

KW - Balanced fairness

KW - Flow throughput

KW - Recursion for normalization constant

KW - Tree network

U2 - 10.1016/j.peva.2004.03.001

DO - 10.1016/j.peva.2004.03.001

M3 - Article

AN - SCOPUS:4344635710

SN - 0166-5316

VL - 58

SP - 1

EP - 14

JO - Performance Evaluation

JF - Performance Evaluation

IS - 1

ER -

Calculating the flow level performance of balanced fairness in tree networks

Abstract

Keywords

Access to Document

Fingerprint

Cite this