Fixed-point approximations of bandwidth sharing networks with rate constraints

Authors:
Maria Frolkova;Josh Reed;Bert Zwart
Affiliations:
CWI, Amsterdam;NYU Stern, Kaufman Management Center, New York, NY;CWI, EURANDOM, VU University Amsterdam, Georgia Tech
Venue:
ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
Year:
2011

Citing 7
Cited 0

Fair end-to-end window-based congestion control

IEEE/ACM Transactions on Networking (TON)
Stability and performance analysis of networks supporting elastic services

IEEE/ACM Transactions on Networking (TON)
Impact of fairness on Internet performance

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A survey on statistical bandwidth sharing

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: In memroy of Olga Casals
Bandwidth-sharing networks in overload

Performance Evaluation
Fluid Limits for Processor-Sharing Queues with Impatience

Mathematics of Operations Research
Heavy-Traffic Optimality of a Stochastic Network Under Utility-Maximizing Resource Allocation

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bandwidth sharing networks are important flow level models of communication networks. We focus on the fact that it takes a significant number of users to saturate a link, necessitating the inclusion of individual rate constraints. In particular we extend work of Reed & Zwart on fluid models of bandwidth sharing with rate constraints under Markovian assumptions: we consider a bandwidth sharing network with rate constraints, where job sizes and deadlines have a general joint distribution. We introduce a fluid model and investigate several of its properties. In particular we show that its invariant point approximates the invariant distribution of the bandwidth sharing network if capacities are large.