Time-shared Systems: a theoretical treatment
Journal of the ACM (JACM)
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
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
Insensitive Bandwidth Sharing in Data Networks
Queueing Systems: Theory and Applications
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
On performance bounds for balanced fairness
Performance Evaluation - Internet performance symposium (IPS 2002)
Rate Performance Objectives of Multihop Wireless Networks
IEEE Transactions on Mobile Computing
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
Queueing Systems: Theory and Applications
Fluid models of integrated traffic and multipath routing
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
The resource pooling principle
ACM SIGCOMM Computer Communication Review
Processor sharing flows in the internet
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Insensitive, maximum stable allocations converge to proportional fairness
Queueing Systems: Theory and Applications
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Optimal queue-size scaling in switched networks
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence
Mathematics of Operations Research
| Hi-index | 0.01 |
We review two areas of recent research linking proportional fairness with product form networks. The areas concern, respectively, the heavy traffic and the large deviations limiting regimes for the stationary distribution of a flow model, where the flow model is a stochastic process representing the randomly varying number of document transfers present in a network sharing capacity according to the proportional fairness criterion. In these two regimes we postulate the limiting form of the stationary distribution, by comparison with several variants of the fairness criterion. We outline how product form results can help provide insight into the performance consequences of resource pooling.