## Stochastic Systems

### Many-server queues with customer abandonment: Numerical analysis of their diffusion model

#### Abstract

We use a multidimensional diffusion process to approximate the dynamics of a queue served by many parallel servers. Waiting customers in this queue may abandon the system without service. To analyze the diffusion model, we develop a numerical algorithm for computing its stationary distribution. A crucial part of the algorithm is choosing an appropriate reference density. Using a conjecture on the tail behavior of the limit queue length process, we propose a systematic approach to constructing a reference density. With the proposed reference density, the algorithm is shown to converge quickly in numerical experiments. These experiments demonstrate that the diffusion model is a satisfactory approximation for many-server queues, sometimes for queues with as few as twenty servers.

#### Article information

Source
Stoch. Syst., Volume 3, Number 1 (2013), 96-146.

Dates
First available in Project Euclid: 24 February 2014

https://projecteuclid.org/euclid.ssy/1393251982

Digital Object Identifier
doi:10.1214/11-SSY029

Mathematical Reviews number (MathSciNet)
MR3353469

Zentralblatt MATH identifier
1296.60243

#### Citation

Dai, J. G.; He, Shuangchi. Many-server queues with customer abandonment: Numerical analysis of their diffusion model. Stoch. Syst. 3 (2013), no. 1, 96--146. doi:10.1214/11-SSY029. https://projecteuclid.org/euclid.ssy/1393251982

#### References

• [1] Brown, L., Gans, N., Mandelbaum, A., Sakov, A., Shen, H., Zeltyn, S., and Zhao, L. (2005). Statistical analysis of a telephone call center: A queueing-science perspective. J. Amer. Statist. Assoc. 100, 469, 36–50.
• [2] Browne, S. and Whitt, W. (1995). Piecewise-linear diffusion processes. In Advances in Queueing: Theory, Methods, and Open Problems, J. H. Dshalalow, Ed. CRC, Boca Raton, FL, 463–480.
• [3] Dai, J. G. and Dieker, A. B. (2011). Nonnegativity of solutions to the basic adjoint relationship for some diffusion processes. Queueing Syst. 68, 3–4, 295–303.
• [4] Dai, J. G. and Harrison, J. M. (1991). Steady-state analysis of RBM in a rectangle: Numerical methods and a queueing application. Ann. Appl. Probab. 1, 1, 16–35.
• [5] Dai, J. G. and Harrison, J. M. (1992). Reflected Brownian motion in an orthant: Numerical methods for steady-state analysis. Ann. Appl. Probab. 2, 1, 65–86.
• [6] Dai, J. G., He, S., and Tezcan, T. (2010). Many-server diffusion limits for $G/Ph/n+GI$ queues. Ann. Appl. Probab. 20, 5, 1854–1890.
• [7] Dieker, A. B. and Gao, X. (2013). Positive recurrence of piecewise Ornstein–Uhlenbeck processes and common quadratic Lyapunov functions. Ann. Appl. Probab.. To appear.
• [8] Ethier, S. N. and Kurtz, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York.
• [9] Gamarnik, D. and Goldberg, D. A. (2013). Steady-state $GI/GI/n$ queue in the Halfin–Whitt regime. Ann. Appl. Probab.. To appear.
• [10] Gamarnik, D. and Momčilović, P. (2008). Steady-state analysis of a multiserver queue in the Halfin–Whitt regime. Adv. in Appl. Probab. 40, 2, 548–577.
• [11] Garnett, O., Mandelbaum, A., and Reiman, M. (2002). Designing a call center with impatient customers. Manufacturing & Service Operations Management 4, 3, 208–227.
• [12] Gilbarg, D. and Trudinger, N. S. (2001). Elliptic Partial Differential Equations of Second Order. Springer–Verlag, Berlin.
• [13] Halfin, S. and Whitt, W. (1981). Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29, 3, 567–588.
• [14] Harrison, J. M. and Nguyen, V. (1990). The QNET method for two-moment analysis of open queueing networks. Queueing Syst. 6, 1, 1–32.
• [15] Iglehart, D. L. (1965). Limiting diffusion approximations for the many server queue and the repairman problem. J. Appl. Probab. 2, 2, 429–441.
• [16] Iglehart, D. L. and Whitt, W. (1970). Multiple channel queues in heavy traffic II: Sequences, networks, and batches. Adv. in Appl. Probab. 2, 2, 355–369.
• [17] Kannan, R. and Vempala, S. (2008). Spectral algorithms. Found. Trends Theor. Comput. Sci. 4, 3–4, 157–288.
• [18] Kovalov, P., Linetsky, V., and Marcozzi, M. (2007). Pricing multi-asset American options: A finite element method-of-lines with smooth penalty. J. Sci. Comput. 33, 3, 209–237.
• [19] Kress, R. (1998). Numerical Analysis. Springer–Verlag, New York.
• [20] Latouche, G. and Ramaswami, V. (1999). Introduction to Matrix Analytic Methods in Stochastic Modeling. SIAM, Philadelphia, PA.
• [21] Mandelbaum, A. and Zeltyn, S. (2007). Service engineering in action: The Palm/Erlang-A queue with applications to call centers. In Advances in Services Innovations, D. Spath and K.-P. Fähnrich, Eds. Springer–Verlag, Berlin, 17–45.
• [22] Neuts, M. F. (1981). Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Johns Hopkins University Press, Baltimore, MD.
• [23] Oden, J. T. and Reddy, J. N. (1976). An Introduction to the Mathematical Theory of Finite Elements. Wiley, New York.
• [24] Øksendal, B. (2003). Stochastic Differential Equations: An Introduction with Applications, 6th ed. Springer–Verlag, Berlin.
• [25] Puhalskii, A. A. and Reiman, M. I. (2000). The multiclass $GI/PH/N$ queue in the Halfin–Whitt regime. Adv. in Appl. Probab. 32, 2, 564–595. Correction: 36, 3, 971 (2004).
• [26] Reed, J. and Tezcan, T. (2012). Hazard rate scaling of the abandonment distribution for the $GI/M/n+GI$ queue in heavy traffic. Oper. Res. 60, 4, 981–995.
• [27] Reed, J. E. and Ward, A. R. (2008). Approximating the $GI/GI/1+GI$ queue with a nonlinear drift diffusion: Hazard rate scaling in heavy traffic. Math. Oper. Res. 33, 3, 606–644.
• [28] Reiman, M. I. (1984). Open queueing networks in heavy traffic. Math. Oper. Res. 9, 3, 441–458.
• [29] Saure, D., Glynn, P., and Zeevi, A. (2009). A linear programming algorithm for computing the stationary distribution of semimartingale reflected Brownian motion. Tech. rep., Graduate School of Business, Columbia University.
• [30] Shen, X., Chen, H., Dai, J. G., and Dai, W. (2002). The finite element method for computing the stationary distribution of an SRBM in a hypercube with applications to finite buffer queueing networks. Queueing Syst. 42, 1, 33–62.
• [31] Whitt, W. (1982). On the heavy-traffic limit theorem for $GI/G/\infty$ queues. Adv. in Appl. Probab. 14, 1, 171–190.
• [32] Whitt, W. (2005). Heavy-traffic limits for the $G/H_{2}^{*}/n/m$ queue. Math. Oper. Res. 30, 1, 1–27.
• [33] Williams, R. J. (1996). On the approximation of queueing networks in heavy traffic. In Stochastic Networks: Theory and Applications, F. P. Kelly, S. Zachary, and I. Ziedins, Eds. Oxford University Press, Oxford, UK, 35–56.
• [34] Zeltyn, S. and Mandelbaum, A. (2005). Call centers with impatient customers: Many-server asymptotics of the $M/M/n+G$ queue. Queueing Syst. 51, 3–4, 361–402.