On the distributions of infinite server queues with batch arrivals
- 129 Downloads
Queues that feature multiple entities arriving simultaneously are among the oldest models in queueing theory, and are often referred to as “batch” (or, in some cases, “bulk”) arrival queueing systems. In this work, we study the effect of batch arrivals on infinite server queues. We assume that the arrival epochs occur according to a Poisson process, with treatment of both stationary and non-stationary arrival rates. We consider both exponentially and generally distributed service durations, and we analyze both fixed and random arrival batch sizes. In addition to deriving the transient mean, variance, and moment-generating function for time-varying arrival rates, we also find that the steady-state distribution of the queue is equivalent to the sum of scaled Poisson random variables with rates proportional to the order statistics of its service distribution. We do so through viewing the batch arrival system as a collection of correlated sub-queues. Furthermore, we investigate the limiting behavior of the process through a batch scaling of the queue and through fluid and diffusion limits of the arrival rate. In the course of our analysis, we make important connections between our model and the harmonic numbers, generalized Hermite distributions, and truncated polylogarithms.
KeywordsBatch arrivals Infinite server General service Time-varying
Mathematics Subject Classification60K25 90B22 60G50
We acknowledge the generous support of the National Science Foundation (NSF) for Jamol Pender’s Career Award CMMI # 1751975 and Andrew Daw’s NSF Graduate Research Fellowship under Grant DGE-1650441.
- 1.Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions: With Formulas, Graphs, and Mathematical Tables, vol. 55. Courier Corporation, North Chelmsford (1965)Google Scholar
- 6.Daw, A., Pender, J.: New perspectives on the Erlang-A queue. Adv. Appl. Probab. 51(1), (2019)Google Scholar
- 10.Engblom, S., Pender, J.: Approximations for the moments of nonstationary and state dependent birth-death queues. arXiv:1406.6164 (2014)
- 16.Kemp, C.D., Kemp, A.W.: Some properties of the ‘Hermite’ distribution. Biometrika 52(3–4), 381–394 (1965)Google Scholar
- 23.Mandelbaum, A., Zeltyn, S.: Service engineering in action: the Palm/Erlang-A queue, with applications to call centers. In: Spath, D., Fähnrich, K.-P. (eds.) Advances in Services Innovations, pp. 17–45. Springer, Berlin (2007)Google Scholar
- 26.Miller Jr., R.G.: A contribution to the theory of bulk queues. J. R. Stat. Soc. Ser. B (Methodological) 21(2), 320–337 (1959)Google Scholar
- 29.Pender, J.: Poisson and Gaussian approximations for multi-server queues with batch arrivals and batch abandonment. Technical report, Cornell University, Ithaca, NY (2013)Google Scholar
- 31.Pender, J., Phung-Duc, T.: A law of large numbers for M/M/c/delayoff-setup queues with nonstationary arrivals. In: International Conference on Analytical and Stochastic Modeling Techniques and Applications, pp. 253–268. Springer, Beilin (2016)Google Scholar
- 33.Pender, J., Rand, R.H., Wesson, E.: Strong approximations for queues with customer choice and constant delays (under revision)Google Scholar