Abstract
We consider an M [X]/G/1 retrial queue subject to breakdowns where the retrial time is exponential and independent of the number of customers applying for service. If a coming batch of customers finds the server idle, one of the arriving customers begins his service immediately and the rest joins a retrial group (called orbit) to repeat his request later; otherwise, if the server is busy or down, all customers of the coming batch enter the orbit. It is assumed that the server has a constant failure rate and arbitrary repair time distribution. We study the ergodicity of the embedded Markov chain, its stationary distribution and the joint distribution of the server state and the orbit size in steady-state. The orbit and system size distributions are obtained as well as some performance measures of the system. The stochastic decomposition property and the asymptotic behavior under high rate of retrials are discussed. We also analyse some reliability problems, the k-busy period and the ordinary busy period of our retrial queue. Besides, we give a recursive scheme to compute the distribution of the number of served customers during the k-busy period and the ordinary busy period. The effects of several parameters on the system are analysed numerically.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aissani, A. (1993). Unreliable queuing with repeated orders. Microelectronics and Reliability, 33, 2093–2106.
Aissani, A. (1994). A retrial queue with redundancy and unreliable server. Queueing Systems, 17, 431–449.
Aissani, A. (2000). An M X/G/1 retrial queue with exhaustive vacations. Journal of Statistics and Management Systems, 3, 269–286.
Aissani, A., & Artalejo, J. (1998). On the single server retrial queue subject to breakdowns. Queueing Systems, 30, 309–321.
Artalejo, J. (1994). New results in retrial queueing systems with breakdown of the servers. Statistica Neerlandica, 48, 23–36.
Artalejo, J. (1997). Analysis of an M/G/1 queue with constant repeated attempts and server vacations. Computers and Operations Research, 24, 493–504.
Artalejo, J. (1998). Some results on the M/G/1 queue with N-policy. Asia-Pacific Journal of Operational Research, 15, 147–157.
Artalejo, J. (1999a). A classified bibliography of research on retrial queues: progress in 1990–1999. Top, 7, 187–211.
Artalejo, J. (1999b). Accessible bibliography on retrial queues. Mathematical and Computer Modelling, 30, 1–6.
Artalejo, J., & Falin, G. (1994). Stochastic decomposition for retrial queues. Top, 2, 329–342.
Artalejo, J., & López-Herrero, M. J. (2000). On the busy period of the M/G/1 retrial queue. Naval Research Logistics, 47, 115–127.
Atencia, I., Fortes, I., Moreno, P., & Sánchez, S. (2006). An M/G/1 retrial queue with active breakdowns and Bernoulli schedule in the server. Information and Management Sciences, 17, 1–17.
Avi-Itzhak, B., & Naor, P. P. (1963). Some queuing problems with the service station subject to breakdown. Operations Research, 11, 303–320.
Bocharov, P. P., Pechinkin, A. V., & Albores, F. J. Teoría de colas. Universidad Autónoma de Tlaxcala, México (1997)
Bruneel, H., & Kim, B. G. (1993). Discrete-time models for communication systems including ATM. Boston: Kluwer Academic.
Choi, B. D., & Chang, Y. (1999). Single server retrial queues with priority calls. Mathematical and Computer Modelling, 30, 7–32.
Choi, B. D., Rhee, K. H., & Park, K. K. (1993). The M/G/1 retrial queue with retrial rate control policy. Probability in the Engineering and Informational Sciences, 7, 29–46.
Djellab, N. V. (2002). On the M/G/1 retrial queue subjected to breakdowns. RAIRO Operations Research, 36, 299–310.
Doshi, B. (1990). Stochastic analysis of computer and communication systems. Amsterdam: North-Holland. pp. 217–265
Falin, G. (1990). A survey of retrial queues. Queueing Systems, 7, 127–168.
Falin, G., & Templeton, J. G. C. (1997). Retrial queues. London: Chapman & Hall.
Farahmand, K. (1990). Single line queue with repeated demands. Queueing Systems, 6, 223–228.
Fayolle, G. (1986). A simple telephone exchange with delayed feedbacks. In O. J. Boxma, J. W. Cohen & M. C. Tijms (Eds.), Teletraffic analysis and computer performance evaluation (pp. 245–253). Amsterdam: North-Holland.
Fuhrmann, S. W., & Cooper, R. B. (1985). Stochastic decomposition in the M/G/1 queue with generalized vacations. Operations Research, 33, 1117–1129.
Krishna Kumar, B., Arivudainambi, D., & Vijayakumar, A. (2002a). An M/G/1/1 queue with unreliable server and no waiting capacity. Information and Management Sciences, 13, 35–50.
Krishna Kumar, B., Pavai, M. S., & Vijayakumar, A. (2002b). The M/G/1 retrial queue with feedback and starting failures. Applied Mathematical Modelling, 26, 1057–1075.
Kulkarni, V. G., & Choi, B. D. (1990). Retrial queues with server subject to breakdowns and repairs. Queueing Systems, 7, 191–208.
Li, H., & Zhao, Y. Q. (2005). A retrial queue with a constant retrial rate, server downs and impatient customers. Stochastic Models, 21, 531–550.
Li, W., Shi, D., & Chao, X. (1997). Reliability analysis of M/G/1 queueing systems with server breakdowns and vacations. Journal of Applied Probability, 34, 546–555.
López-Herrero, M. J. (2002a). Distribution of the number of customers served in an M/G/1 retrial queue. Journal of Applied Probability, 39, 407–412.
López-Herrero, M. J. (2002b). On the number of customers served in the M/G/1 retrial queue: first moments and maximum entropy approach. Computers and Operations Research, 29, 1739–1757.
Martín, M., & Artalejo, J. (1995). Analysis of an M/G/1 queue with two types of impatient units. Advances in Applied Probability, 27, 840–861.
Pakes, A. G. (1969). Some conditions for ergodicity and recurrence of Markov chains. Operations Research, 17, 1058–1061.
Parzen, E. (1972). Procesos estocásticos. Madrid: Paraninfo.
Shanthikumar, J. G. (1988). On stochastic decomposition in M/G/1 type queues with generalized server vacations. Operations Research, 36, 566–569.
Tang, Y. H. (1997). A single-server M/G/1 queueing system subject to breakdowns. Some reliability and queueing problems. Microelectronics and Reliability, 37, 315–321.
Tijms, H. C. (2003). A first course in stochastic models. Chichester: Wiley.
Wang, J., Cao, J., & Li, Q. (2001). Reliability analysis of the retrial queue with server breakdowns and repairs. Queueing Systems, 38, 363–380.
Yang, T., & Li, H. (1994). The M/G/1 retrial queue with the server subject to starting failures. Queueing Systems, 16, 83–96.
Yang, T., & Templeton, J. G. C. (1987). A survey on retrial queues. Queueing Systems, 2, 201–233.
Yue, D., & Cao, J. (1997). Reliability analysis of a \(M_{1}^{X_{1}},M_{2}^{X_{2}}/G_{1},G_{2}/1\) queueing system with a repairable service station. Microelectronics and Reliability, 37, 1225–1231.
Author information
Authors and Affiliations
Corresponding author
Additional information
I. Atencia’s and Moreno’s research is supported by the MEC through the project MTM2005-01248.
Rights and permissions
About this article
Cite this article
Atencia, I., Bouza, G. & Moreno, P. An M [X]/G/1 retrial queue with server breakdowns and constant rate of repeated attempts. Ann Oper Res 157, 225–243 (2008). https://doi.org/10.1007/s10479-007-0192-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-007-0192-2