Data networks
Elements of information theory
Elements of information theory
Insensitive Bandwidth Sharing in Data Networks
Queueing Systems: Theory and Applications
On performance bounds for balanced fairness
Performance Evaluation - Internet performance symposium (IPS 2002)
Calculating the flow level performance of balanced fairness in tree networks
Performance Evaluation
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
Queueing Systems: Theory and Applications
Flow-optimized random access for wireless multihop networks
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Flow-optimized random access for wireless multihop networks
Performance Evaluation
Approximating flow throughput in complex data networks
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
| Hi-index | 0.00 |
Flow level analysis of communication networks with multiple shared resources is generally difficult. A recently introduced sharing scheme called balanced fairness has brought these systems within the realm of tractability. While straightforward in principle, the numerical evaluation of practically interesting performance metrics like per-flow throughput is feasible for limited state spaces only, besides some specific networks where the results are explicit. In the present paper, we study the behaviour of balanced fairness in light and heavy traffic regimes and show how the corresponding performance results can be used to approximate the flow throughput over the whole load range. The results apply to any network, with a state space of arbitrary dimension. A few examples are explicitly worked out to illustrate the concepts.