Data networks
IEEE Transactions on Information Theory
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
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)
Flow-level stability of data networks with non-convex and time-varying rate regions
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Stability of networks under general file size distribution with alpha fair rate allocation
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
| Hi-index | 0.00 |
We consider a queueing model where documents are simultaneously transferred over a communication network. The bandwidth allocated to each document transfer is assumed to be the solution of a utility optimization problem. Under a natural stability condition and under the assumption that document arrivals are Poisson and that document sizes are independent exponential distributions, such queueing models have been proven to be positive recurrent. It has been conjectured for a decade that the assumption of exponentially distributed documents can be removed. There exist numerous generalizations without this exponential assumption, but a general proof remains elusive.