Group service system with three queues and load balancing
-
Maxim P. Savelov
Abstract
A group service system for three queues is considered. At each time t = 1, 2, . . ., with some probability, a customer enters the system, selects randomly two queues, and goes to the shorter one. At each moment such that there is at least one customer in each queue, each queue performs instantly the service of one customer. By means of Lyapunov functions, a criterion for the ergodicity of the Markov chain corresponding to this queuing system is established. The limiting joint distribution of queue lengths is found, and the connection with the problem of balanced allocations of particles into cells is described. In the corresponding problem of balanced allocation of particles, the limiting distribution of the range is found, i. e. the difference between the maximal and minimal numbers of particles in cells.
Note
Originally published in Diskretnaya Matematika (2020) 32,№4, 103–119 (in Russian).
Funding statement: The study was supported by the Russian Fund of Basic Research (grant№17-11-01173).
Acknowledgment
The author is grateful to A.M. Zubkov for the problem statement and constant attention.
References
[1] Flatto L., McKean H., “Two queues in parallel”, Comm. Pure Appl. Math., 30 (1977), 255–263.10.1002/cpa.3160300206Search in Google Scholar
[2] Adan I. J.,Wessels J., ZijmW. H. M., “Analysis of the asymmetric shortest queue problem”, Queueing Systems, 8 (1991), 1–58.10.1007/BF02412240Search in Google Scholar
[3] Kurkova I. A., “A load-balanced network with two servers”, Queueing Systems, 37 (2001), 379—389.10.1023/A:1010841517511Search in Google Scholar
[4] Vvedenskaya N.D., Dobrushin R. L., Karpelevich F. I., “Queueing system with selection of the shortest of two queues: An asymptotic approach”, Problems Inform. Transmission, 32:1 (1996), 15–27.Search in Google Scholar
[5] Eschenfeldt P., Gamarnik D., “Join the shortest queue with many servers. The heavy-traffic asymptotics”, Math. Oper. Res., 43:3 (2018), 867—886.10.1287/moor.2017.0887Search in Google Scholar
[6] Azar Y., Broder A., Karlin A., Upfal E., “Balanced allocations”, SIAM J. Comput., 29:1 (1999), 180–200.10.1137/S0097539795288490Search in Google Scholar
[7] Czumaj A., Stemann V., “Randomized allocation processes”, Random Struct. Algor., 18 (2001), 297–331.10.1109/SFCS.1997.646108Search in Google Scholar
[8] Mitzenmacher M., Richa A., Sitaraman R., “The power of two random choices: a survey of techniques and results”,Handbook of Randomized Computing, 1, Kluwer, 2001, 255–312.10.1007/978-1-4615-0013-1_9Search in Google Scholar
[9] Young D. H., “Two alternatives to the standard χ2-test of the hypothesis of equal cell frequencies”, Biometrika, 49:1–2 (1962), 107-–116.10.1093/biomet/49.1-2.107Search in Google Scholar
[10] Corrado C. J., “The exact distribution of the maximum, minimum and the range of multinomial/Dirichlet and multivariate hypergeometric frequencies”, Stat. Comput., 21 (2011), 349—359.10.1007/s11222-010-9174-3Search in Google Scholar
[11] Bonetti M., Cirillo P., Ogay A., “Computing the exact distributions of some functions of the ordered multinomial counts: Maximum, minimum, range and sums of order statistics”, Royal Soc. Open Science, 6:10 (2019), 1—32.10.1098/rsos.190198Search in Google Scholar PubMed PubMed Central
[12] Doshi, B. T., “Queueing systems with vacations. A survey.”, Queueing Systems, 1:1 (1986), 29—66.10.1007/BF01149327Search in Google Scholar
[13] Fayolle G., Malyshev V. A., Menshikov M. M., Topics in the Constructive Theory of Countable Markov Chains, Cambridge Univ. Press, Cambridge, 1995, 169 pp.10.1017/CBO9780511984020Search in Google Scholar
[14] Borovkov A. A., Probability Theory, New York: Gordon & Breach, 1998, 474 pp.Search in Google Scholar
© 2022 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Contents
- Group service system with three queues and load balancing
- Formulas for the numbers of sequences containing a given pattern given number of times
- On a generalization of class of negative binomial distributions
- Invertible matrices over some quotient rings: identification, generation, and analysis
- On synthesis of reversible circuits consisting of NOT, CNOT, 2-CNOT gates with small number of additional inputs
- Computation of distributions of statistics by means of Markov chains
Articles in the same Issue
- Contents
- Group service system with three queues and load balancing
- Formulas for the numbers of sequences containing a given pattern given number of times
- On a generalization of class of negative binomial distributions
- Invertible matrices over some quotient rings: identification, generation, and analysis
- On synthesis of reversible circuits consisting of NOT, CNOT, 2-CNOT gates with small number of additional inputs
- Computation of distributions of statistics by means of Markov chains
