Abstract
We consider a discrete-time Geo/G/1 retrial queue in which the retrial time has a general distribution and the server, after each service completion, begins a process of search in order to find the following customer to be served. We study the Markov chain underlying the considered queueing system and its ergodicity condition. We find the generating function of the number of customers in the orbit and in the system. We derive the stochastic decomposition law and as an application we give bounds for the proximity between the steady-state distributions for our queueing system and its corresponding standard system. Also, we develop recursive formulae for calculating the steady-state distribution of the orbit and system sizes. Besides, we prove that the M/G/1 retrial queue with general retrial times can be approximated by our corresponding discrete-time system. Finally, we give numerical examples to illustrate the effect of the parameters on several performance characteristics.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.R. Artalejo, A classified bibliography of research on retrial queues: Progress in 1990-1999, Top 7(2) (1999) 187-211.
J.R. Artalejo, Accessible bibliography on retrial queues, Math. Comput. Modelling 30 (1999) 1-6.
J.R. Artalejo and G.I. Falin, Stochastic decomposition for retrial queues, Top 2 (1994) 329-342.
I. Atencia and P. Moreno, Discrete-time Geo [X] /G H /1 retrial queue with Bernoulli feedback, To appear in Comput. Math. Appl.
H. Bruneel and B.G. Kim, Discrete-TimeModels for Communication Systems Including ATM(Kluwer Academic, Boston, 1993).
B.D. Choi and J.W. Kim, Discrete-time Geo 1 , Geo 2 /G/1 retrial queueing system with two types of calls, Comput. Math. Appl. 33(10) (1997) 79-88.
G.I. Falin and J.G.C. Templeton, Retrial Queues(Chapman & Hall, London, 1997).
S.W. Fuhrmann and R.B. Cooper, Stochastic decompositions in the M/G/1 queue with generalized vacations, Oper. Res. 33(5) (1985) 1117-1129.
A. Gómez-Corral, Stochastic analysis of a single server retrial queue with general retrial times, Naval Res. Logistics 46 (1999) 561-581.
J.J. Hunter, Mathematical Techniques of Applied Probability, Vol. 2, Discrete-Time Models: Techniques and Applications(Academic Press, New York, 1983).
H. Li and T. Yang, Geo/G/1 discrete time retrial queue with Bernoulli schedule, European J. Oper. Res. 111(3) (1998) 629-649.
H. Li and T. Yang, Steady-state queue size distribution of discrete-time PH/Geo/1 retrial queues, Math. Comput. Modelling 30 (1999) 51-63.
T. Meisling, Discrete time queueing theory, Oper. Res. 6 (1958) 96-105.
M.F. Neuts and M.F. Ramalhoto, A service model in which the server is required to search for customers, J. Appl. Probab. 21 (1984) 157-166.
H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation, Discrete-Time Systems, Vol. 3 (North-Holland, Amsterdam, 1993).
M. Takahashi, H. Osawa and T. Fujisawa, Geo [X] /G/1 retrial queue with non-preemptive priority, Asia-Pacific J. Oper. Res. 16(2) (1999) 215-234.
M.E. Woodward, Communication and Computer Networks: Modelling with Discrete-Time Queues(IEEE Computer Soc. Press, Los Alamitos, CA, 1994).
T. Yang and H. Li, On the steady-state queue size distribution of the discrete-time Geo/G/1 queue with repeated customers, Queueing Systems 21 (1995) 199-215.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Atencia, I., Moreno, P. A Discrete-Time Geo /G/1 Retrial Queue with General Retrial Times. Queueing Systems 48, 5–21 (2004). https://doi.org/10.1023/B:QUES.0000039885.12490.02
Issue Date:
DOI: https://doi.org/10.1023/B:QUES.0000039885.12490.02