The Annals of Applied Probability

Join the shortest queue: stability and exact asymptotics

R. D. Foley and D. R. McDonald

Full-text: Open access

Abstract

We consider the stability of a network serving a patchwork of overlapping regions where customers from a local region are assigned to a collection of local servers.These customers join the queue of the local server with the shortest queue of waiting customers.We then describe how the backlog in the network overloads.We do this in the simple case of two servers each of which receives a dedicated stream of customers in addition to customers from a stream of smart customers who join the shorter queue. There are three distinct ways the backlog can overload. If one server is very fast, then that server takes all the smart customers along with its dedicated customers and keeps its queue small while the dedicated customers at the other server cause the overload.We call this the unpooled case. If the proportion of smart customers is large, then the two servers overload in tandem.We call this the strongly pooled case. Finally, there is the weakly pooled case where both queues overload but in different proportions. The fact that strong pooling can be attained based on a local protocol for overlapping regions may have engineering significance. In addition, this paper extends the methodology developed in McDonald (to appear The Annals of Applied Probability) to cover periodicities. The emphasis here is on sharp asymptotics, not rough asymptotics as in large deviation theory. Moreover, the limiting distributions are for the unscaled process, not for the fluid limit as in large deviation theory. In the strongly pooled case, for instance, we give the limiting distribution of the difference between the two queues as the backlog grows.We also give the exact asymptotics of the mean time until overload.

Article information

Source
Ann. Appl. Probab., Volume 11, Number 3 (2001), 569-607.

Dates
First available in Project Euclid: 5 March 2002

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1015345342

Digital Object Identifier
doi:10.1214/aoap/1015345342

Mathematical Reviews number (MathSciNet)
MR1865017

Zentralblatt MATH identifier
1016.60078

Subjects
Primary: 60K25: Queueing theory [See also 68M20, 90B22]
Secondary: 60K20: Applications of Markov renewal processes (reliability, queueing networks, etc.) [See also 90Bxx]

Keywords
Join the shortest queue rare events change of measure h-transform

Citation

Foley, R. D.; McDonald, D. R. Join the shortest queue: stability and exact asymptotics. Ann. Appl. Probab. 11 (2001), no. 3, 569--607. doi:10.1214/aoap/1015345342. https://projecteuclid.org/euclid.aoap/1015345342


Export citation

References

  • [1] Adan, I. J., Wessels, J. and Zijm, W. H. M. (1991). Analysis of the asymmetric shortest queue problem. Queueing Systems Theory Appl. 8 1-58.
  • [2] Atar, R. and Dupuis, P. (1999). Large deviations and queueing networks: methods for rate function identification. Stochastic Process. Appl. 84 255-296.
  • [3] Alanyali, M. and Hajek, B. (1998). On large deviations in load sharing networks. Ann. Appl. Probab. 8 67-97.
  • [4] Alanyali, M. and Hajek, B. (1998). On large deviations of Markov processes with discontinuous statistics. Ann. Appl. Probab. 8 45-66.
  • [5] Asmussen, S. (1982). Conditioned limit theorems relating a random walk to its associate, with applications to risk reserve processes and the GI/G/1 queue. Adv. in Appl. Probab. 14 143-170.
  • [6] Brown, L. (1998). Asymptotic behaviour of an overloading queueing network with resource pooling. Ph.D. dissertation, Georgia Institute of Technology.
  • [7] Cinlar, E. (1975). Introduction to Stochastic Processes. Prentice-Hall, Englewood Cliffs, NJ.
  • [8] Chernova, N. and Foss, S. (1998). On the stability of a partially accessible multi-station queue with state-dependent routing. Questa 29 55-73.
  • [9] Dupuis, P. and Ellis, R. S. (1995). The large deviation principle for a general class of queueing systems I. Trans. Amer. Math. Soc. 8 2689-2751.
  • [10] Flatto, L. and McLean, H. P. (1977). Two queues in parallel. Comm. Pure Appl. Math. 30 255-263.
  • [11] Kesten, H. (1974). Renewals theory for functionals of a Markovchain with general state space, Ann. Probab. 2 355-386.
  • [12] Knessl, C., Matkowsky, B. J., Schuss, Z. and Tier, C. (1986). Two parallel queues with dynamic routing. IEEE Trans. Comm. 34 1170-1175.
  • [13] McDonald, D. (1996). Overloading parallel servers when arrivals join the shortest queue. Stochastic Networks: Stability and Rare Events Lecture Notes in Statist. 117 169-196. Springer, New York.
  • [14] McDonald, D. (1999). Asymptotics of first passage times for random walk in a quadrant. Ann. Appl. Probab. 9 110-145.
  • [15] Meyn, S. P. and Tweedie, R. L. (1993). Markov Chains and Stochastic Stability. Springer, New York.
  • [16] Meyn, S. P. (1997). The policy iteration algorithm for average reward Markov decision processes with general state spaces. Unpublished manuscript.
  • [17] Shwartz, A. and Weiss, A. (1993). Induced rare events: analysis via large deviations and time reversal. Adv. Appl. Probab. 25 667-689.
  • [18] Shwartz, A. and Weiss, A. (1994). Large Deviations for Performance Analysis. Chapman and Hall, London.
  • [19] Turner, S. R. E. (1996). Large deviations for join the shorter queue. In Analysis of Networks: Communication, Call Centres, Traffic, and Performance (D. McDonald and S. R. E. Turner, eds.) 95-108. Fields Institute Communications.
  • [20] van Houtum, G. J., Adan, I. J. B. F., Wessels, J. and Zijm, W. H. M. (1999). Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism. Unpublished manuscript.