Abstract
In this paper, we are concerned with the analytical treatment of an GI/M/1 retrial queue with constant retrial rate. Constant retrial rate is typical for some real world systems where the intensity of individual retrials is inversely proportional to the number of customers in the orbit or only one customer from the orbit is allowed to make the retrials. In our model, a customer who finds the server busy joins the queue in the orbit in accordance with the FCFS (first-come-first-out) discipline and only the oldest customer in the queue is allowed to make the repeated attempts to reach the server. A distinguishing feature of the considered system is an arbitrary distribution of inter-arrival times, while the overwhelming majority of the papers is devoted to the retrial systems with the stationary Poisson arrival process. We carry out an extensive analytical analysis of the queue in steady state using the well-known matrix analytic technique. The ergodicity condition and simple expressions for the stationary distributions of the system states at pre-arrival, post-arrival and arbitrary times are derived. The important and difficult problem of finding the stationary distribution of the sojourn time is solved in terms of the Laplace–Stieltjes transform. Little’s formula is proved. Numerical illustrations are presented.
Similar content being viewed by others
References
Artalejo JR, Joshua VC, Krishnamoorthy A (2002) An M/G/1 retrial queue with orbital search by the server. In: Advances in stochastic modelling. Notable Publications Inc, New York, pp 41–54
Breuer L, Dudin A, Klimenok V (2002) A retrial BMAP/PN/N system. Queueing Syst 40:433–457
Chakravarthy SR, Krishnamoorthy A, Joshua VC (2006) Analysis of a multi-server queue with search of customers from the orbit. Perform Eval 63:776–798
Choi BD, Park KK, Pearce CEM (1993) An M/M/1 retrial queue with control policy and general retrial times. Queueing Syst 14:275–292
Cinlar E (1975) Introduction to stochastic processes. Prentice-Hall, New York
Dudin AN, Krishnamoorthy A, Joshua VC, Tsarenkov GV (2004) Analysis of the BMAP/G/1 retrial system with search of customers from the orbit. Eur J Oper Res 157:169–179
Falin GI, Templeton JGC (1997) Retrial queues. Chapman & Hall, London
Farahmand K (1990) Single line queue with repeated demands. Queueing Syst 6:223–228
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
Gomez-Corral A (1999) Stochastic analysis of a single server retrial queue with general retrial times. Nav Res Logist 46:561–581
Gomez-Corral A (2006) A bibliographical guide to the analysis of retrial queues through matrix analytic techniques. Ann Oper Res 141:163–191
Lillo RE (1996) A G/M/1-queue with exponential retrials. Top 4:99–120
Neuts MF (1981) Matrix-geometric solutions in stochastic models—an algorithmic approach. Johns Hopkins University Press, Baltimore
Neuts MF, Ramalhoto MF (1984) A service model in which the server is required to search for customers. J Appl Probab 21:157–166
van Danzig D (1955) Chaines de Markof dans les ensembles abstraits et applications aux processus avec regions absorbantes et au probleme des boucles. Ann. Inst. Henri Poincaré 14(fasc 3):145–199
Acknowledgements
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (Grant No. 2010-0003269).
Authors are thankful to three anonymous referees for their helpful comments which allowed to improve initial version of the manuscript.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kim, C., Klimenok, V. & Dudin, A. A G/M/1 retrial queue with constant retrial rate. TOP 22, 509–529 (2014). https://doi.org/10.1007/s11750-012-0267-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-012-0267-3