Abstract
Sherman and Kharoufeh (Oper. Res. Lett. 34:697–705, [2006]) considered an M/M/1 type queueing system with unreliable server and retrials. In this model it is assumed that if the server fails during service of a customer, the customer leaves the server, joins a retrial group and in random intervals repeats attempts to get service. We suggest an alternative method for analysis of the Markov process, which describes the functioning of the system, and find the joint distribution of the server state, the number of customers in the queue and the number of customers in the retrial group in steady state.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Sherman, N.P., Kharoufeh, J.P.: An M/M/1 retrial queue with unreliable server. Oper. Res. Lett. 34, 697–705 (2006)
Falin, G.I., Templeton, J.G.C.: Retrial Queues. Chapman and Hall, London (1997)
Sherman, N.P., Kharoufeh, J.P., Abramson, M.: An M/G/1 retrial queue with unreliable server for streaming multimedia applications. Probab. Eng. Inf. Sci. (in press)
Tweedie, R.L.: Sufficient conditions for regularity, recurrence and ergodicity of Markov processes. In: Math. Proceedings of the Cambridge Philosophical Society, vol. 78, part 1 (1975)
Malyshev, M.V., Menshikov, M.V.: Ergodicity, continuity and analyticity of countable Markov chains. In: Proceedings of the Moscow Math. Society, vol. 39 (1979)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Falin, G.I. The M/M/1 retrial queue with retrials due to server failures. Queueing Syst 58, 155–160 (2008). https://doi.org/10.1007/s11134-008-9065-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-008-9065-x