Hostname: page-component-76fb5796d-skm99 Total loading time: 0 Render date: 2024-04-25T15:15:53.663Z Has data issue: false hasContentIssue false
  • English
  • Français

The generalized join the shortest orbit queue system: stability, exact tail asymptotics and stationary approximations

Published online by Cambridge University Press:  19 January 2022

Ioannis Dimitriou Open the ORCID record for Ioannis Dimitriou [Opens in a new window]
Ioannis Dimitriou*
Affiliation:
Department of Mathematics, University of Patras, 26504 Patras, Greece. E-mail: idimit@math.upatras.gr
Get access Rights & Permissions [Opens in a new window]

Abstract

We introduce the generalized join the shortest queue model with retrials and two infinite capacity orbit queues. Three independent Poisson streams of jobs, namely a smart, and two dedicated streams, flow into a single-server system, which can hold at most one job. Arriving jobs that find the server occupied are routed to the orbits as follows: Blocked jobs from the smart stream are routed to the shortest orbit queue, and in case of a tie, they choose an orbit randomly. Blocked jobs from the dedicated streams are routed directly to their orbits. Orbiting jobs retry to connect with the server at different retrial rates, i.e., heterogeneous orbit queues. Applications of such a system are found in the modeling of wireless cooperative networks. We are interested in the asymptotic behavior of the stationary distribution of this model, provided that the system is stable. More precisely, we investigate the conditions under which the tail asymptotic of the minimum orbit queue length is exactly geometric. Moreover, we apply a heuristic asymptotic approach to obtain approximations of the steady-state joint orbit queue-length distribution. Useful numerical examples are presented and shown that the results obtained through the asymptotic analysis and the heuristic approach are agreed.

Keywords

Exact tail asymptoticsGeneralized join the shortest orbit queueRetrialsStabilityStationary approximations
Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 37 , Issue 1 , January 2023 , pp. 154 - 191
Copyright
Copyright © The Author(s), 2022. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Adan, I.J.B.F., Wessels, J., & Zijm, W.H. (1990). Analysis of the symmetric shortest queue problem. Stochastic Models 6(1): 691–713.CrossRefGoogle Scholar
Adan, I.J.B.F., Wessels, J., & Zijm, W.H.M. (1991). Analysis of the asymmetric shortest queue problem. Queueing Systems 8(1): 1–58.CrossRefGoogle Scholar
Adan, I.J.B.F., Wessels, J., & Zijm, W. (1993). A compensation approach for two-dimensional Markov processes. Advances in Applied Probability 25(4): 783–817.CrossRefGoogle Scholar
Adan, I., van Houtum, G.-J., & van der Wal, J. (1994). Upper and lower bounds for the waiting time in the symmetric shortest queue system. Annals of Operations Research 48(2): 197–217.CrossRefGoogle Scholar
Adan, I.J.B.F., Boxma, O.J., & Resing, J.A.C. (2001). Queueing models with multiple waiting lines. Queueing Systems 37(1–3): 65–98.CrossRefGoogle Scholar
Adan, I.J.B.F., Kapodistria, S., & van Leeuwaarden, J.S.H. (2013). Erlang arrivals joining the shorter queue. Queueing Systems 74(2–3): 273–302.CrossRefGoogle Scholar
Artalejo, J.R. & Gómez-Corral, A. (2008). Retrial queueing systems: A computational approach. Berlin, Heidelberg: Springer.CrossRefGoogle Scholar
Blanc, J.P.C. (1987). A note on waiting times in systems with queues in parallel. Journal of Applied Probability 24(2): 540–546.CrossRefGoogle Scholar
Cohen, J. & Boxma, O. (1983). Boundary value problems in queueing systems analysis. Amsterdam, Netherlands: North Holland Publishing Company.Google Scholar
Dimitriou, I. (2017). A queueing system for modeling cooperative wireless networks with coupled relay nodes and synchronized packet arrivals. Performance Evaluation 114: 16–31.CrossRefGoogle Scholar
Dimitriou, I. (2021). Analysis of the symmetric join the shortest orbit queue. Operations Research Letters 49(1): 23–29.CrossRefGoogle Scholar
Falin, G. & Templeton, J. (1997). Retrial queues. London: Chapman & Hall.CrossRefGoogle Scholar
Fayolle, G., Malyshev, V.A., & Menshikov, M. (1995). Topics in the constructive theory of countable Markov chains. Cambridge: Cambridge University Press.CrossRefGoogle Scholar
Fayolle, G., Iasnogorodski, R., & Malyshev, V. (2017). Random walks in the quarter-plane: Algebraic methods, boundary value problems, applications to queueing systems and analytic combinatorics. Berlin: Springer-Verlag.CrossRefGoogle Scholar
Foley, R.D. & McDonald, D.R. (2001). Join the shortest queue: Stability and exact asymptotics. Annals of Applied Probability 11(3): 569–607.CrossRefGoogle Scholar
Foschini, G. & Salz, J. (1978). A basic dynamic routing problem and diffusion. IEEE Transactions on Communications 26(3): 320–327.CrossRefGoogle Scholar
Gertsbakh, I. (1984). The shorter queue problem: A numerical study using the matrix-geometric solution. European Journal of Operational Research 15(3): 374–381.CrossRefGoogle Scholar
Haight, F.A. (1958). Two queues in parallel. Biometrika 45(3/4): 401–410.CrossRefGoogle Scholar
Kapodistria, S. & Palmowski, Z. (2017). Matrix geometric approach for random walks: Stability condition and equilibrium distribution. Stochastic Models 33(4): 572–597.CrossRefGoogle Scholar
Kemeny, J.G., Snell, J.L., & Knapp, A.W. (1976). Denumerable Markov Chains, 2nd ed. New York, USA: Springer.CrossRefGoogle Scholar
Kingman, J.F.C. (1961). Two similar queues in parallel. The Annals of Mathematical Statistics 32(4): 1314–1323.CrossRefGoogle Scholar
Knessl, C., Matkowsky, B., Schuss, Z., & Tier, C. (1986). Two parallel queues with dynamic routing. IEEE Transactions on Communications 34(12): 1170–1175.CrossRefGoogle Scholar
Kobayashi, M., Sakuma, Y., & Miyazawa, M. (2013). Join the shortest queue among k parallel queues: Tail asymptotics of its stationary distribution. Queueing Systems 74: 303–332.CrossRefGoogle Scholar
Kurkova, I. (2001). A load-balanced network with two servers. Queueing Systems 37: 379–389.CrossRefGoogle Scholar
Kurkova, I.A. & Suhov, Y.M. (2003). Malyshev's theory and JS-queues. Asymptotics of stationary probabilities. Annals of Applied Probability 13(4): 1313–1354.CrossRefGoogle Scholar
Li, H., Miyazawa, M., & Zhao, Y. (2007). Geometric decay in a QBD process with countable background states with applications to a join-the-shortest-queue model. Stochastic Models 23(3): 413–438.CrossRefGoogle Scholar
Malyshev, V.A. (1973). Asymptotic behavior of the stationary probabilities for two-dimensional positive random walks. Sibirskii Matematicheskii Žhurnal 14: 156–169, 238.Google Scholar
Meyn, S. & Tweedie, R.L. (2009). Markov chains and stochastic stability, 2nd ed. USA: Cambridge University Press.CrossRefGoogle Scholar
Miyazawa, M. (2009). Tail decay rates in double QBD processes and related reflected random walks. Mathematics of Operations Research 34(3): 547–575.CrossRefGoogle Scholar
Miyazawa, M. (2009). Two sided DQBD process and solutions to the tail decay rate problem and their applications to the generalized join shortest queue. New York, NY: Springer New York, pp. 3–33.Google Scholar
Miyazawa, M. (2011). Light tail asymptotics in multidimensional reflecting processes for queueing networks. TOP 19(2): 233–299.CrossRefGoogle Scholar
Neuts, M.F. (1981). Matrix-geometric solutions in stochastic models: An algorithmic approach. Baltimore: Johns Hopkins University Press.Google Scholar
Ozawa, T. (2013). Asymptotics for the stationary distribution in a discrete-time two-dimensional quasi-birth-and-death process. Queueing Systems 74(2): 109–149.CrossRefGoogle Scholar
Ozawa, T. (2019). Stability condition of a two-dimensional QBD process and its application to estimation of efficiency for two-queue models. Performance Evaluation 130: 101–118.CrossRefGoogle Scholar
Pappas, N., Kountouris, M., Ephremides, A., & Traganitis, A. (2015). Relay-assisted multiple access with full-duplex multi-packet reception. IEEE Transactions on Wireless Communications 14(7): 3544–3558.CrossRefGoogle Scholar
Puhalskii, A. & Vladimirov, A. (2007). A large deviation principle for join the shortest queue. Mathematics of Operations Research 32(3): 700–710.CrossRefGoogle Scholar
Rao, B.M. & Posner, M.J.M. (1987). Algorithmic and approximation analyses of the shorter queue model. Naval Research Logistics 34(3): 381–398.3.0.CO;2-K>CrossRefGoogle Scholar
Sakuma, Y. (2010). Asymptotic behavior for MAP/PH/c queue with shortest queue discipline and jockeying. Operations Research Letters 38(1): 7–10.CrossRefGoogle Scholar
Sakuma, Y., Miyazawa, M., & Zhao, Y. (2006). Decay rate for a PH/M/2 queue with shortest queue discipline. Queueing Systems 53: 189–201.CrossRefGoogle Scholar
Takahashi, Y., Fujimoto, K., & Makimoto, N. (2001). Geometric decay of the steady-state probabilities in a quasi-birth-and-death process with a countable number of phases. Stochastic Models 17(1): 1–24.CrossRefGoogle Scholar
Turner, S.R.E. (2000). Large deviations for join the shorter queue. In McDonald, D., & Turner, S.R.E. (eds.), Analysis of Networks: Communication, Call Centres, Traffic, and Performance. Fields Institute Communications. Providence, RI: AMS, pp. 95–108.Google Scholar
Turner, S.R.E. (2000). A join the shorter queue model in heavy traffic. Journal of Applied Probability 37(1): 212–223.CrossRefGoogle Scholar
Zhao, Y.Q. & Liu, D. (1996). The censored Markov chain and the best augmentation. Journal of Applied Probability 33(3): 623–629.CrossRefGoogle Scholar