Abstract
We mathematically investigate a single server system accepting two types of retrial customers and paired service. If upon arrival a customer finds the server busy, it is routed to an infinite capacity orbit queue according to each type. Upon a service completion epoch, if at least one orbit queue is non-empty, the server seeks to find customers from the orbits. If both orbit queues are non-empty, the seeking process will bring to the service area a pair of customers, one from each orbit. If there is only one non-empty, then a single customer from this orbit queue will be brought to the service area. However, if a primary customer arrives during the seeking process it will occupy the server immediately. It is shown that the joint stationary orbit queue length distribution at service completion epochs is determined by solving a Riemann boundary value problem. Stability condition is investigated, while generalizations of the main model are also discussed. A simple numerical example is obtained and yields insight into the behavior of the system.
Similar content being viewed by others
References
Adan, I., Boxma, O., Kapodistria, S., & Kulkarni, V. (2013). The shorter queue polling model. Annals of Operations Research. doi:10.1007/s10479-013-1495-0.
Azarfar, A., Frigon, J.-F., & Sanso, B. (2014). Priority queueing models for cognitive radio networks with traffic differentiation. EURASIP Journal on Wireless Communication and Networking, 206, 1–21.
Artalejo, J. R. (1999). A classified bibliography of research on retrial queues: progress in 1990–1999. Top, 7, 187–211.
Artalejo, J. R. (2010). Accessible bibliography on retrial queues: Progress in 2000–2009. Mathematical and Computer Modelling, 51(9–10), 1071–1081.
Artalejo, J. R. (1997). Analysis of an M/G/1 queue with constant repeated attempts and server vacations. Computers and Operations Research, 24, 493–504.
Artalejo, J. R., & Gomez-Corral, A. (2008). Retrial queueing systems: a computational approach. Berlin: Springer-Verlag.
Atencia, I., Bouza, G., & Moreno, P. (2008). An \(M^{[X]}/G/1\) retrial queue with server breakdowns and constant rate of repeated attempts. Annals of Operations Research, 157(1), 225–243.
Avrachenkov, K., Nain, P., & Yechiali, U. (2014). A retrial system with two input streams and two orbit queues. Queueing Systems, 77, 1–31.
Blanc, J.P.C. (1982). Application of the Theory of Boundary Value Problems in the Analysis of a Queueing Model with Paired Services. PhD Thesis, University of Utrecht.
Blanc, J. P. C. (1984). Asymptotic analysis of a queueing system with two-dimensional state-space. Journal of Applied Probability, 21, 870–886.
Boxma, O. (1984). Two symmetric queues with alternating service and switching times. In E. Gelenbe (Ed.), Performance Evaluation (pp. 409–431). Amsterdam: North-Holland.
Boxma, O., & Groenendijk, W. P. (1988). Two queues with alternating service and switching times. In O. Boxma & R. Syski (Eds.), Queueing Theory and its Applications (pp. 261–281). Amsterdam: North-Holland.
Choi, B. D., Rhee, K. H., & Park, K. K. (1993a). The M/G/1 retrial queue with retrial rate control policy. Probability in the Engineering and Informational Sciences, 7, 29–46.
Choi, B. D., Park, K. K., & Pearce, C. E. M. (1993b). An M/M/1 retrial queue with control policy and general retrial times. Queueing Systems, 14, 275–292.
Cohen, J. W., & Boxma, O. (1981). The M/G/1 queue with alternating service discipline formulated as Riemann-Hilbert problem. In F. J. Kylstra (Ed.), Performance ’81 (pp. 181–199). Amsterdam: North-Holland.
Cohen, J. W., & Boxma, O. (1983). Boundary value problems in queueing systems analysis. Amsterdam: North-Holland.
Cohen, J. W. (1994). On a class of two-dimensional nearest-neighbour random walks. Journal of Applied Probability, 31, 207–237.
Cohen, J. W. (1988). Boundary value problems in queueing theory. Queueing Systems, 3, 97–128.
Cohen, J. W. (1985). On the analysis of parallel independent processors, preprint 374. Math. Inst., Univ. Utrecht.
Cohen, J. W. (1992). Analysis of random walks. Amsterdam: I.O.S. Press.
Falin, G. I., & Templeton, J. G. C. (1997). Retrial queues. London: Chapman & Hall.
Falin, G. I. (1988). On a multiclass batch arrival retrial queue. Advances in Applied Probability, 20, 483–487.
Farahmand, K. (1990). Single line queue with repeated demands. Queueing Systems, 6, 223–228.
Fayolle, G., & Iasnogorodski, R. (1979). Two coupled processors: The reduction to a Riemann-Hilbert problem. Zeitschrift fur Wahrscheinlichkeitstheorie und Verwandte Gebiete, 47, 325–351.
Fayolle, G. (1986). A simple telephone exchange with delayed feedbacks. In O. Boxma, J. W. Cohen, & H. Tijms (Eds.), Teletraffic analysis and computer performance evaluation (pp. 245–253). Amsterdam: North-Holland.
Fayolle, G., Iasnogorodski, R., & Malyshev, V. (1999). Random walks in quarter plane, algebraic methods, boundary value problems and applications. Berlin: Springer-Verlag.
Feng, W., Kowada, M., & Adachi, K. (1998). A two-queue model with Bernoulli service schedule and switching times. Queueing Systems, 30, 405–434.
Gakhov, F. G. (1966). Boundary value problems. Oxford: Pergamon Press.
Gao, S., Wang, J., & Van Do, T. (2015). A repairable retrial queue under Bernoulli schedule and general retrial policy. Annals of Operations Research. doi:10.1007/s10479-015-1885-6.
Gomez-Corral, A. (2006). A bibliographical guide to the analysis of retrial queues through matrix analytic techniques. Annals of Operations Research, 141(1), 163–191.
Gomez-Corral, A. (1999). Stochastic analysis of a single server retrial queue with general retrial times. Naval Research Logistics, 46, 561–581.
Goseling, J., Boucherie, R. J., & Van Ommeren, J. K. (2011). Queueing analysis of wireless network coding. Netherlands: University of Twente, Department of applied mathematics, Memorandum 1943. http://doc.utwente.nl/77319/.
Krishna Kumar, B., & Arivudainambi, D. (2002). The \(M/G/1\) retrial queue with Bernoulli schedules and general retrial times. Computers and Mathematics with Applications, 43, 15–30.
Krishna Kumar, B., Arivudainambi, D., & Vijayakumar, A. (2002a). On the \(M^{X}/G/1\) retrial queue with Bernoulli schedules and general retrial times. Asia-Pacific Journal of Operational Research, 19(2), 177–194.
Krishna Kumar, B., Vijayakumar, A., & Arivudainambi, D. (2002b). An M/G/1 retrial queueing system with two-phase service and preemptive resume. Annals of Operations Research, 113(1–4), 61–79.
Krishna Kumar, B., & Raja, J. (2006). On multiserver feedback retrial queues with balking and control retrial rate. Annals of Operations Research, 141, 211–232.
Kulkarni, V. G. (1986). Expected waiting times in a multiclass batch arrival retrial queue. Journal of Applied Probability, 23, 144–154.
Langaris, C., & Dimitriou, I. (2010). A queueing system with n-phases of service and (n-1)-types of retrial customers. European Journal of Operational Research, 205, 638–649.
Lee, D. S. (1997). Analysis of a cyclic server queue with Bernoulli schedules. Journal of Applied Probability, 34, 176–191.
Li, H., & Zhao, Y. Q. (2005). A retrial queue with a constant retrial rate, server downs and impatient customers. Stochastic Models, 21, 531–550.
Markushevich, A. (1977). Theory of functions of a complex variable. New York: Chelsea Publ. Co.
Muskhelishvili, N. (1992). Singular integral equations. New York: Dover Publications.
Moutzoukis, E., & Langaris, C. (1996). Non-preemptive priorities and vacations in a multiclass retrial queueing system. Stochastic Models, 12(3), 455–472.
Nehari, Z. (1975). Conformal mapping. New York: Dover Publications.
Papadimitriou, G., Pappas, N., Traganitis, A., & Angelakis, V. (2015). Network-level performance evaluation of a two-relay cooperative random access wireless system. Computer Networks, 88, 187–201.
Resing, J. A. C., & Örmeci, L. (2003). A tandem queueing model with coupled processors. Operations Research Letters, 31, 383–389.
Song, Y., Liu, Z., & Zhao, Y. Q. (2015). Exact tail asymptotics: revisit of a retrial queue with two input streams and two orbits. Annals of Operations Research. doi:10.1007/s10479-015-1945-y.
Van Leeuwaarden, J. S. H., & Resing, J. A. C. (2005). A tandem queue with coupled processors: Computational issues. Queueing Systems, 50, 29–52.
Winkler, A. (2013). Dynamic scheduling of a single-server two-class queue with constant retrial policy. Annals of Operations Research, 202(1), 197–210.
Acknowledgments
The author is grateful to the editor and the anonymous referees for the valuable remarks and comments, from which the presentation of the paper has benefited. A part of this work was carried out at INRIA and the MAESTRO Project team, during the tenure of an ERCIM “Alain Bensoussan” Fellowship Program and had received funding by the EU 7th Framework Program (FP7/2007–2013) under Grant Agreement No. 246016.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The author declare that has no conflict of interest.
Rights and permissions
About this article
Cite this article
Dimitriou, I. A queueing model with two classes of retrial customers and paired services. Ann Oper Res 238, 123–143 (2016). https://doi.org/10.1007/s10479-015-2059-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-015-2059-2