Data networks
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Optimal flow control and routing in multi-path networks
Performance Evaluation - Special issue: Internet performance and control of network systems
Insensitive Bandwidth Sharing in Data Networks
Queueing Systems: Theory and Applications
Calculating the flow level performance of balanced fairness in tree networks
Performance Evaluation
Stability of end-to-end algorithms for joint routing and rate control
ACM SIGCOMM Computer Communication Review
Large deviations of sojourn times in processor sharing queues
Queueing Systems: Theory and Applications
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
IEEE/ACM Transactions on Networking (TON)
The resource pooling principle
ACM SIGCOMM Computer Communication Review
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)
Resource pooling in congested networks: proportional fairness and product form
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
Multipath flow control has been proposed as a key way to improve the Internet's performance, reliability, and flexibility in supporting changing loads. Yet, at this point, there are very few tools to quantify the performance benefits; particularly in the context of a stochastic network supporting best effort flows, e.g., file transfers and web browsing sessions, where the metric of interest is transfer delay. This paper's focus is on developing analysis tools to evaluate flow-level performance and to support network design when multipath bandwidth allocation is based on proportional fairness. To overcome the analytical intractability of such systems we study closely related multipath approximations based on insensitive allocations such as balanced fairness. We obtain flow-level performance bounds on the mean per bit delay, exhibiting the role of resource pooling in the network, and use these to explore scenarios where increased path diversity need not result in high gains. While insightful these results are difficult to use to drive network design and capacity allocation. To that end, we study the large deviations for congestion events, i.e., accumulation of flows, in networks supporting multipath flow control. We show that such asymptotics are determined by certain critical resource pools, and study the sensitivity of congestion asymptotics to the pool's capacity and traffic loads. This suggests a disciplined approach to a capacity allocation problem in multipath networks based on a linear optimization problem.