Abstract
We consider a stochastic network with mobile users in a heavy traffic regime. We derive the scaling limit of the multidimensional queue length process and prove a form of spatial state space collapse. The proof exploits a recent result by Lambert and Simatos (preprint, 2012), which provides a general principle to establish scaling limits of regenerative processes based on the convergence of their excursions. We also prove weak convergence of the sequences of stationary joint queue length distributions and stationary sojourn times.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Billingsley, P.: Convergence of Probability Measures, 2nd edn. Wiley Series in Probability and Statistics: Probability and Statistics. Wiley, New York (1999)
Borst, S., Proutière, A., Hegde, N.: Capacity of wireless data networks with intra- and inter-cell mobility. In: Proceedings of IEEE INFOCOM 2006, Barcelona, Spain, April 2006, pp. 1058–1069 (2006)
Bramson, M.: State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Syst. 30(1–2), 89–140 (1998)
Feuillet, M., Robert, P.: On the transient behavior of Ehrenfest and Engset processes. Adv. Appl. Probab. 44(2), 562–582 (2012). doi:10.1239/aap/1339878724
Ganesh, A., Lilienthal, S., Manjunath, D., Proutière, A., Simatos, F.: Load balancing via random local search in closed and open systems. In: Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS’10, pp. 287–298. ACM, New York (2010)
Herstein, I.N., Winter, D.J.: Matrix Theory and Linear Algebra. Macmillan Co., New York (1988)
Jacod, J., Shiryaev, A.N.: Limit Theorems for Stochastic Processes, 2nd edn. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 288. Springer, Berlin (2003)
Lambert, A., Simatos, F.: The weak convergence of regenerative processes using some excursion path decompositions. (2012, preprint). Available on arXiv
Lambert, A., Simatos, F., Zwart, B.: Scaling limits via excursion theory: interplay between Crump-Mode-Jagers branching processes and processor-sharing queues (2011, submitted). Available on arXiv
Lamperti, J.: Criteria for the recurrence or transience of stochastic process. I. J. Math. Anal. Appl. 1, 314–330 (1960)
Pinsker, M.S.: Information and Information Stability of Random Variables and Processes. Holden-Day, San Francisco (1964). Translated and edited by Amiel Feinstein
Reiman, M.I.: The heavy traffic diffusion approximation for sojourn times in Jackson networks. In: Applied Probability—Computer Science: The Interface, Vol. II, Boca Raton, Fla., 1981. Progr. Comput. Sci., vol. 3, pp. 409–421. Birkhäuser Boston, Boston (1982)
Reiman, M.I.: Some diffusion approximations with state space collapse. In: Modelling and Performance Evaluation Methodology, Paris, 1983. Lecture Notes in Control and Inform. Sci., vol. 60, pp. 209–240. Springer, Berlin (1984)
Sengupta, B.: An approximation for the sojourn-time distribution for the GI/G/1 processor-sharing queue. Commun. Stat., Stoch. Models 8(1), 35–57 (1992)
Simatos, F., Tibi, D.: Spatial homogenization in a stochastic network with mobility. Ann. Appl. Probab. 20(1), 312–355 (2010)
Stolyar, A.L.: Maxweight scheduling in a generalized switch: state space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. 14(1), 1–53 (2004)
Verloop, I.M., Ayesta, U., Núñez-Queija, R.: Heavy-traffic analysis of a multiple-phase network with discriminatory processor sharing. Oper. Res. 59(3), 648–660 (2011)
Whitt, W.: Stochastic-Process Limits. An Introduction to Stochastic-Process Limits and Their Application to Queues. Springer Series in Operations Research. Springer, New York (2002)
Williams, R.J.: Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse. Queueing Syst. 30(1–2), 27–88 (1998)
Yashkov, S.F.: On a heavy traffic limit theorem for the M/G/1 processor-sharing queue. Commun. Stat., Stoch. Models 9(3), 467–471 (1993)
Zwart, A.P., Boxma, O.J.: Sojourn time asymptotics in the M/G/1 processor sharing queue. Queueing Syst. 35(1–4), 141–166 (2000)
Acknowledgements
Most of this research was carried out while the second author was affiliated with CWI and sponsored by an NWO-VIDI grant.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Borst, S., Simatos, F. A stochastic network with mobile users in heavy traffic. Queueing Syst 74, 1–40 (2013). https://doi.org/10.1007/s11134-012-9330-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-012-9330-x