Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Aldous, D.: Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels. IEEE Trans. Inf. Theory 33, 219–223 (1987)
Bertsekas, D., Gallager, R.: Data Networks. Prentice Hall, New York (1987)
Bonald, T., Massoulié, L.: Impact of fairness on Internet performance. Proc. ACM Sigmetrics 29, 82–91 (2001)
Bonald, T., Proutière, A.: Insensitive bandwidth sharing in data networks. Queueing Syst. 44, 69–100 (2003)
Bramson, M.: Stability of Queueing Networks. Lecture Notes in Mathematics, vol. 1950. Springer, Berlin (2008). Lectures from the 36th Probability Summer School held in Saint-Flour, July 2–15, 2006
Bramson, M.: Network stability under max-min fair bandwidth sharing. Ann. Appl. Probab. 20, 1126–1176 (2010). doi:10.1214/09-AAP649
Chiang, M., Shah, D., Tang, A.: Stochastic stability under network utility maximization: General file size distribution. In: Proceedings of Allerton, vol. 5, pp. 49–77 (2006)
Dai, J.G.: On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Ann. Appl. Probab. 5(1), 49–77 (1995)
Dai, J.G.: Stability of open multiclass queueing networks via fluid models. In: Stochastic Networks. The IMA Volumes in Mathematics and Its Applications, vol. 71, pp. 71–90. Springer, Berlin (1995)
Darling, R.W.R.: Fluid limits of pure jump Markov processes: A practical guide. CoRR arXiv:math/0210109v3 (2002)
Darling, R.W.R., Norris, J.R.: Differential equation approximations for Markov chains. Probab. Surv. 5, 37 (2008). doi:10.1214/07-PS121
De Veciana, G.L., Konstantopoulos, T.: Stability and performance analysis of networks supporting services with rate control—could the Internet be unstable? IEEE/ACM Trans. Netw. 9(1), 2–14 (1999)
Getoor, R.K.: Transience and recurrence of Markov processes. In: Séminaire de Probabilités, XIV (Paris, 1978/1979) (French). Lecture Notes in Math., vol. 784, pp. 397–409. Springer, Berlin (1980)
Gromoll, H., Williams, R.: Fluid model for a data network with alpha-fair bandwidth sharing and general document size distributions: two examples of stability. Markov Process. Relat.Top. 4, 253–265 (2008). A Festschrift for Thomas G. Kurtz
Gromoll, H., Williams, R.: Fluid limits for networks with bandwidth sharing and general document size distributions. Ann. Appl. Probab. 19(1), 243–280 (2009)
Harris, T.E.: The existence of stationary measures for certain Markov processes. In: Proceedings of the Third Berkeley Symposium on Mathematical Statistics and Probability, 1954–1955, vol. II, pp. 113–124. University of California Press, Berkeley (1956)
Kelly, F.: The mathematics of traffic in networks. The Princeton Companion to Mathematics (2008). www.statslab.cam.ac.uk/~frank/PAPERS/princeton.html
Kelly, F.P.: Charging and rate control for elastic traffic. Eur. Trans. Telecommun. 8, 33–37 (1997)
Kelly, F.P., Williams, R.J.: Fluid model for a network operating under a fair bandwidth-sharing policy. Ann. Appl. Probab. 14, 1055–1083 (2004)
Kelly, F.P., Maulloo, A.K., Tan, D.K.H.: Rate control in communication networks: shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 49, 237–252 (1998)
Lakshmikantha, A., Beck, C., Srikant, R.: On the use of sos methods for analysis of connection-level stability in the Internet. In: American Control Conference, 2005. Proceedings of the 2005, vol. 4, pp. 2705–2708 (2005). doi:10.1109/ACC.2005.1470377
Lin, X., Shroff, N.B.: On the stability region of congestion control (2004)
Liu, J., Proutiere, A., Yi, Y., Chiang, M., Poor, H.V.: Flow-level stability of data networks with non-convex and time-varying rate regions. SIGMETRICS Perform. Eval. Rev. 35, 239–250 (2007)
Massoulié, L.: Structural properties of proportional fairness: Stability and insensitivity. Ann. Appl. Probab. 17, 809–839 (2007)
Massoulié, L., Roberts, J.: Bandwidth sharing and admission control for elastic traffic. Telecommun. Syst. 15, 185–201 (1998)
Meyn, S.P., Down, D.: Stability of generalized Jackson networks. Ann. Appl. Probab. 4(1), 124–148 (1994)
Meyn, S.P., Tweedie, R.L.: Generalized resolvents and Harris recurrence of Markov processes. In: Doeblin and Modern Probability, Blaubeuren, 1991. Contemp. Math., vol. 149, pp. 227–250. Amer. Math. Soc., Providence (1993)
Meyn, S.P., Tweedie, R.L.: Markov Chains and Stochastic Stability. Springer, London (1993)
Meyn, S.P., Tweedie, R.L.: Stability of Markovian processes. II. Continuous-time processes and sampled chains. Adv. Appl. Probab. 25(3), 487–517 (1993). doi:10.2307/1427521
Meyn, S.P., Tweedie, R.L.: Stability of Markovian processes. III. Foster–Lyapunov criteria for continuous-time processes. Adv. Appl. Probab. 25(3), 518–548 (1993). doi:10.2307/1427522
Mo, J., Walrand, J.: Fair end-to-end window-based congestion control. IEEE/ACM Trans. Netw. 8, 556–567 (2000)
Paganini, F., Tang, A., Ferragut, A., Andrew, L.L.H.: Stability of networks under general file size distribution with alpha fair rate allocation. In: Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton’09, pp. 136–142. IEEE Press, Piscataway (2009). http://portal.acm.org/citation.cfm?id=1793974.1793997
Srikant, R.: The Mathematics of Internet Congestion Control. Birkhäuser, Basel (2004)
Ye, H.Q.: Stability of data networks under an optimization-based bandwidth allocation. IEEE Trans. Autom. Control 48(7), 1238–1242 (2003). doi:10.1007/s11134-011-9233-2
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Walton, N.S., Mandjes, M.R.H. A stability conjecture on bandwidth sharing networks. Queueing Syst 68, 237–250 (2011). https://doi.org/10.1007/s11134-011-9233-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-011-9233-2