Approximating flow throughput in complex data networks

Authors:
Juha Leino;Aleksi Penttinen;Jorma Virtamo
Affiliations:
Networking Laboratory, TKK Helsinki University of Technology, TKK, Finland;Networking Laboratory, TKK Helsinki University of Technology, TKK, Finland;Networking Laboratory, TKK Helsinki University of Technology, TKK, Finland
Venue:
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Year:
2007

Citing 6
Cited 2

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
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
Insensitive load balancing in data networks

Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Flow level analysis of data networks has recently taken a major step towards tractability with the introduction of a resource sharing scheme called balanced fairness. We consider the balanced fairness concept in analyzing per-flow throughput in complex networks with a large number of flow classes. The two existing practical approaches in the setting, namely performance bounds and asymptotic analysis, require that the capacity set of the network is given explicitly as a set of (linear) constraints. We extend the asymptotic analysis method by providing explicit expressions for the second order throughput derivative in the light traffic regime. We show how asymptotic analysis can be applied in multipath routing and wireless networks, where the linear constraints cannot be readily worked out in explicit form. Finally, we introduce a numerical throughput analysis scheme based on Monte Carlo method.