zbMATH — the first resource for mathematics

Heavy-traffic limits for a many-server queueing network with switchover. (English) Zbl 1282.60091
The authors study a multiclass Markovian queueing network of multi-server stations. Exogenous arrivals in each station follow a non-stationary Poisson process. Each job waiting for the service in a queue may, after some exponentially distributed time depending on the system state, switch to another station or leave the network. The authors study the performance of the network under many-server heavy traffic limiting regimes, including the critically loaded quality-and-efficiency-driven (QED) regime, and the overloaded efficiency-driven (ED) regime. They also study the limits corresponding to the mixture of the under-loaded quality driven (QD) regime with QED and ED regimes. The fluid and diffusion limits of the queue-length processes in all regimes are established in the form of ordinary differential equations and stochastic differential equations, respectively. In the case of the QD regime, the load balancing effect of switchover in the mixed regimes is investigated.

60K25 Queueing theory (aspects of probability theory)
60F17 Functional limit theorems; invariance principles
90B22 Queues and service in operations research
Full Text: DOI Euclid
[1] Berman, A. and Plemmons, R. J. (1979). Nonnegative Matrices in the Mathematical Sciences. Academic Press, New York. · Zbl 0484.15016
[2] Billingsley, P. (1999). Convergence of Probability Measures , 2nd edn. John Wiley, New York. · Zbl 0944.60003
[3] Bonald, T. et al . (2009). Flow-level performance and capacity of wireless networks with user mobility. Queueing Systems 63 , 131-164. · Zbl 1190.90042
[4] Borst, S., Mandelbaum, A. and Reiman, M. I. (2004). Dimensioning large call centers. Operat. Res. 52 , 17-34. · Zbl 1165.90388
[5] Borst, S., Proutiere, A. and Hegde, N. (2006). Capacity of wireless data networks with intra- and inter-cell mobility. In Proc. IEEE INFOCOM 2006 (Barcelona, Spain), 12pp.
[6] Bramson, M., Lu, Y. and Prabhakar, B. (2010). Randomized load balancing with general service time distributions. ACM SIGMETRICS Performance Evaluation Rev. 38 , 275-286.
[7] Chen, H. and Yao, D. D. (2001). Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization (Appl. Math. 46 ). Springer, New York. · Zbl 0992.60003
[8] Dieker, A. B. and Gao. X. (2013). Positive recurrence of piecewise Ornstein-Uhlenbeck processes and common quadratic Lyapunov function. Ann. Appl. Prob. 23 , 1291-1317. · Zbl 1273.60108
[9] Erlang, A. K. (1948). On the rational determination of the number of circuits. In The Life and Works of A. K. Erlang , eds E. Brockmeyer, H. L. Halstrom and A. Jensen, The Copenhagen Telephone Company, Copenhagen, Denmark.
[10] Fleming, P. J., Stolyar, A. and Simon, B. (1995). Heavy traffic limit for a mobile phone system loss model. In Proc. Nashville ACM Telecommunications Conf.
[11] Ganesh, A. et al . (2010). Load balancing via random local research in closed and open systems. ACM SIGMETRICS Performance Evaluation Rev . 38 , 287-298.
[12] Garnett, O., Mandelbaum, A. and Reiman, M. I. (2002). Designing a call center with impatient customers. Manufacturing Service Operat. Manag. 4 , 208-227.
[13] Grossglauser, M. and Tse, D. N. C. (2002). Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. Networking 10 , 477-486.
[14] Gurvich, I. and Whitt, W. (2009). Queue-and-idleness-ratio controls in many-server service systems. Math. Operat. Res. 34 , 363-396. · Zbl 1213.60149
[15] Halfin, S. and Whitt, W. (1981). Heavy-traffic limits for queues with many exponential servers. Operat. Res. 29 , 567-588. · Zbl 0455.60079
[16] He, S. and Dai, J. (2013). Many-server queues with customer abandonment: numerical analysis of their diffusion models. To appear in Stoch. Systems. · Zbl 1296.60243
[17] Kang, W. and Pang, G. (2013). Fluid limit of a multiclass many-server queueing network with abandonment and feedback. Submitted.
[18] Kang, W. and Ramanan, K. (2010). Fluid limits of many-server queues with reneging. Ann. Appl. Prob. 20 , 2204-2260. · Zbl 1208.60094
[19] Karatzas, I. and Shreve, S. E. (1991). Brownian Motion and Stochastic Calculus , 2nd edn. Springer, New York. · Zbl 0734.60060
[20] Mandelbaum, A., Massey, W. A. and Reiman, M. I. (1998). Strong approximations for Markovian service networks. Queueing Systems 30 , 149-201. · Zbl 0911.90167
[21] Pang, G., Talreja, R. and Whitt, W. (2007). Martingale proofs of many-server heavy-traffic limits for Markovian queues. Prob. Surveys 4 , 193-267. · Zbl 1189.60067
[22] Perry, O. and Whitt, W. (2013). A fluid limit for an overloaded X model via a stochastic averaging principle. Math. Operat. Res. 38 , 294-349. · Zbl 1305.60024
[23] Puhalskii, A. (1994). On the invariance principle for the first passage time. Math. Operat. Res. 19 , 946-954. · Zbl 0837.60034
[24] Saure, D., Glynn, P. W. and Zeevi, A. (2009). A linear programming algorithm for computing the stationary distribution of semimartingale reflected Brownian motion. Working paper.
[25] Simatos, F. and Tibi, D. (2010). Spatial homogenization in a stochastic network with mobility. Ann. Appl. Prob . 20 , 312-355. · Zbl 1202.60150
[26] Talreja, R. and Whitt, W. (2009). Heavy-traffic limits for waiting times in many-server queues with abandonment. Ann. Appl. Prob. 19 , 2137-2175. · Zbl 1185.60103
[27] Whitt, W. (2002). Stochastic-Process Limits. Springer, New York. · Zbl 0993.60001
[28] Whitt, W. (2004). Efficiency-driven heavy-traffic approximations for many-server queues with abandonments. Manag. Sci. 50 , 1449-1461. \endharvreferences · Zbl 1232.90158
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.