Calculating the flow level performance of balanced fairness in tree networks

Authors:
T. Bonald;J. Virtamo
Affiliations:
France Telecom R&D, 38-40 Rue du Géénéral Leclerc, 92794 Issy-les-Moulineaux Cedex 9, France;Networking Laboratory, Helsinki University of Technology, P.O. Box 3000, FIN-02015 Hut, Finland
Venue:
Performance Evaluation
Year:
2004

Citing 6
Cited 8

Data networks (2nd ed.)

Data networks (2nd ed.)
Fair end-to-end window-based congestion control

IEEE/ACM Transactions on Networking (TON)
Multiservice Loss Models for Broadband Telecommunication Networks

Multiservice Loss Models for Broadband Telecommunication Networks
Insensitivity in processor-sharing networks

Performance Evaluation
Insensitive Bandwidth Sharing in Data Networks

Queueing Systems: Theory and Applications
On performance bounds for balanced fairness

Performance Evaluation - Internet performance symposium (IPS 2002)

A queueing analysis of max-min fairness, proportional fairness and balanced fairness

Queueing Systems: Theory and Applications
On light and heavy traffic approximations of balanced fairness

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Dimensioning of wireless mesh networks with flow-level QoS requirements

Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
An approximative method for calculating performance measures of Markov processes

valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Approximating flow throughput in complex data networks

ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Stochastic networks with multipath flow control: impact of resource pools on flow-level performance and network congestion

Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Stochastic networks with multipath flow control: impact of resource pools on flow-level performance and network congestion

ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Congestion in large balanced multirate networks

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

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.