Skip to main content
Log in

Exact tail asymptotics: revisit of a retrial queue with two input streams and two orbits

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We revisit a single-server retrial queue with two independent Poisson streams (corresponding to two types of customers) and two orbits. The size of each orbit is infinite. The exponential server (with a rate independent of the type of customers) can hold at most one customer at a time and there is no waiting room. Upon arrival, if a type i customer \((i=1,2)\) finds a busy server, it will join the type i orbit. After an exponential time with a constant (retrial) rate \(\mu _i\), a type i customer attempts to get service. This model has been recently studied by Avrachenkov et al. (Queueing Syst 77(1):1–31, 2014) by solving a Riemann–Hilbert boundary value problem. One may notice that, this model is not a random walk in the quarter plane. Instead, it can be viewed as a random walk in the quarter plane modulated by a two-state Markov chain, or a two-dimensional quasi-birth-and-death process. The special structure of this chain allows us to deal with the fundamental form corresponding to one state of the chain at a time, and therefore it can be studied through a boundary value problem. Inspired by this fact, in this paper, we focus on the tail asymptotic behaviour of the stationary joint probability distribution of the two orbits with either an idle or a busy server by using the kernel method, a different one that does not require a full determination of the unknown generating function. To take advantage of existing literature results on the kernel method, we identify a censored random walk, which is an usual walk in the quarter plane. This technique can also be used for other random walks modulated by a finite-state Markov chain with a similar structure property.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Artalejo, J. R. (2010). Accessible bibliography on retrial queues: Progress in 2000–2009. Mathematical and Computer Modelling, 51, 1071–1081.

    Article  Google Scholar 

  • Artalejo, J. R., & Gómez-Corral, A. (2008). Retrial queueing systems: A computational approach. Berlin: Springer.

    Book  Google Scholar 

  • Artalejo, J. R., Gómez-Corral, A., & Neuts, M. F. (2001). Analysis of multiserver queues with constant retrial rate. European Journal of Operational Research, 135, 569–581.

    Article  Google Scholar 

  • Avrachenkov, K., Nain, P., & Yechiali, U. (2014). A retrial system with two input streams and two orbit queues. Queueing Systems, 77(1), 1–31.

    Article  Google Scholar 

  • Avram, F., Matei, D., & Zhao, Y. Q. (2014). On multiserver retrial queues: History, Okubo-type hypergeometric systems and matrix continued-fractions. Asia-Pacific Journal of Operational Research, 31. doi:10.1142/S0217595914400016

  • Bender, E. (1974). Asymptotic methods in enumeration. SIAM Review, 16, 485–513.

    Article  Google Scholar 

  • Breuer, L., Dudin, A., & Klimenok, V. (2002). A retrial \(BMAP/PN/N\) system. Queueing Systems, 40, 433–457.

    Article  Google Scholar 

  • Choi, B. D., Park, K. K., & Pearce, C. E. M. (1993). An \(M/M/1\) retrial queue with control policy and general retrial times. Queueing Systems, 14, 275–292.

    Article  Google Scholar 

  • Falin, G. (1990). A survey on retrial queue. Queueing Systems, 7, 127–167.

    Article  Google Scholar 

  • Farahmand, K. (1990). Single line queue with repeated demands. Queueing Systems, 6, 223–228.

    Article  Google Scholar 

  • Fayolle, G. (1986). A simple telephone exchange with delayed feedbacks. In Proceedings of the international seminar on teletraffic analysis and computer performance evaluation (pp. 245–253).

  • Fayolle, G., & Iasnogorodski, R. (1979). Two coupled processors: The reduction to a Riemann–Hilbert problem. Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, 47(3), 325–351.

    Article  Google Scholar 

  • Fayolle, G., Iasnogorodski, R., & Malyshev, V. (1999). Random walks in the quarter-plane. New York: Springer.

    Book  Google Scholar 

  • Flajolet, F., & Sedgewich, R. (2009). Analytic combinatorics. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  • Gao, Y. F. (2012). Ph.D. Desertation, School of Mathematics and Statistics, Carleton University.

  • Gómez-Corral, A. (1999). Stochastic analysis of a single server retrial queue with general retrial times. Naval Research Logistics, 46, 561–581.

    Article  Google Scholar 

  • Gómez-Corral, A. (2006). A bibliographical guide to the analysis of retrial queues through matrix analytic techniques. Annals of Operations Research, 141, 163–191.

    Article  Google Scholar 

  • Kim, B., & Kim, J. (2012). Exact tail asymptotics for the \(M/M/m\) retrial queue with nonpersistent customers. Operational Research Letters, 40(6), 537–540.

    Article  Google Scholar 

  • Kim, B., Kim, J., & Kim, J. (2010). Tail asymptotics for the queue size distribution in the \(MAP/G/1\) retrial queue. Queueing Systems, 66, 79–94.

    Article  Google Scholar 

  • Kim, J., Kim, B., & Ko, S.-S. (2007). Tail asymptotics for the queue size distribution in an \(M/G/1\) retrial queue. Journal of Applied Probability, 44, 1111–1118.

    Article  Google Scholar 

  • Kim, J., Kim, J., & Kim, B. (2012). Tail asymptotics of the queue size distribution in the \(M/M/m\) retrial queue. Journal of Computational and Applied Mathematics, 236(14), 3445–3460.

    Article  Google Scholar 

  • Kim, C., Klimenok, V., & Dudin, A. (2014). A \(G/M/1\) retrial queue with constant retrial rate. Top, 22, 509–529.

    Article  Google Scholar 

  • Kobayashi, M., Miyazawa, M., & Zhao, Y. Q. (2010). Tail asymptotics of the occupation measure for a Markov additive process with an \(M/G/1\)-type background process. Stochastic Models, 26, 463–486.

    Article  Google Scholar 

  • Li, H., & Zhao, Y. Q. (2005). A retrial queue with a constant retrial rate, server break downs and impatient customers. Stochastic Models, 21, 531–550.

    Article  Google Scholar 

  • Li, H., & Zhao, Y. Q. (2009). Exact tail asymptotics in a priority queue—Characterizations of the preemptive model. Queueing Systems, 63, 355–381.

    Article  Google Scholar 

  • Li, H., & Zhao, Y. Q. (2011). Tail asymptotics for a generalized two-demand queuing model—A kernel method. Queueing Systems, 69, 77–100.

    Article  Google Scholar 

  • Li, H. & Zhao, Y. Q. (2012). A kernel method for exact tail asymptotics—Random walks in the quarter plane (submitted).

  • Li, H., Tavakoli, J., & Zhao, Y. Q. (2013). Analysis of exact tail asymptotics for singular random walks in the quarter plane. Queueing Systems, 74, 151–179.

    Article  Google Scholar 

  • Liu, B., Wang, X., & Zhao, Y. Q. (2012). Tail asymptotics for \(M/M/c\) retrial queues with nonpersistent customers. Operational Research, 12, 173–188.

    Article  Google Scholar 

  • Miyazawa, M. (2015). Superharmonic vector for a nonnegative matrix with QBD block structure and its application to a Markov modulated two dimensional reflecting process. Queueing Systems, 81(1), 1–48.

    Article  Google Scholar 

  • Miyazawa, M., & Zhao, Y. Q. (2004). The stationary tail asymptotics in the \(GI/G/1\) type queue with countably many background states. Advances in Applied Probability, 36, 1231–1251.

    Article  Google Scholar 

  • Ozawa, T. (2013). Asymptotics for the stationary distribution in a discrete-time two-dimensional quasi-birth-and-death process. Queueing Systems, 74, 109–149.

    Article  Google Scholar 

  • Sakuma, Y., Miyazawa, M., & Zhao, Y. Q. (2006). Decay rate for a \(PH/M/2\) queue with shortest queue discipline. Queueing Systems, 53, 189–201.

    Article  Google Scholar 

  • Shang, W., Liu, L., & Li, Q. L. (2006). Tail asymptotics for the queue length in an \(M/G/1\) retrial queue. Queueing Systems, 52, 193–198.

    Article  Google Scholar 

  • Yang, T., & Templeton, J. (1987). A survey on retrial queue. Queueing Systems, 2, 201–233.

    Article  Google Scholar 

Download references

Acknowledgments

This work was done during the visit of the first two authors to the School of Mathematics and Statistics, Carleton University (Ottawa, Canada), who acknowledge the support provided by the School, and the visit of the third author to the School of Mathematics and Statistics, Nanjing University of Information Science and Technology (Nanjing, China), who acknowledges the support provided by the University. The first author also thanks the China Scholarship Council for supporting her visit to Carleton University through a scholarship. In addition, this work was supported in partial by the National Natural Science Foundation of China (11271373), and by the Natural Sciences and Engineering Research Council of Canada (NSERC). All authors thank the comments/suggestions made by two anonymous reviewers, which significantly improved the quality of the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yiqiang Q. Zhao.

Additional information

In memory of Dr. Jesus R. Artalejo.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Song, Y., Liu, Z. & Zhao, Y.Q. Exact tail asymptotics: revisit of a retrial queue with two input streams and two orbits. Ann Oper Res 247, 97–120 (2016). https://doi.org/10.1007/s10479-015-1945-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-015-1945-y

Keywords

Mathematics Subject Classification

Navigation