A Discrete-Time Geo/G/1 Retrial Queue with General Retrial Times

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.

[1]  J. R. Artalejo,et al.  Stochastic decomposition for retrial queues , 1992 .

[2]  Jesús R. Artalejo,et al.  Accessible bibliography on retrial queues , 1999 .

[3]  Simon Tavare,et al.  Mathematical Techniques of Applied Probability:@@@Vol. 1-Discrete Time Models: Basic Theory@@@Vol. 2-Discrete Time Models: Techniques and Applications. , 1985 .

[4]  H. Li,et al.  Steady-state queue size distribution of discrete-time PH/Geo/1 retrial queues , 1999 .

[5]  Antonio Gómez-Corral,et al.  Stochastic analysis of a single server retrial queue with general retrial times , 1999 .

[6]  Bong Dae Choi,et al.  Discrete-time Geo1, Geo2/G/1 retrial queueing systems with two types of calls , 1997 .

[7]  T. Meisling Discrete-Time Queuing Theory , 1958 .

[8]  Hui Li,et al.  On the steady-state queue size distribution of the discrete-timeGeo/G/1 queue with repeated customers , 1995, Queueing Syst. Theory Appl..

[9]  I. Atencia,et al.  Discrete-time Geo[X]/GH/1 retrial queue with Bernoulli feedback , 2004 .

[10]  Hui Li,et al.  Geo/G/1 discrete time retrial queue with Bernoulli schedule , 1998, Eur. J. Oper. Res..

[11]  Herwig Bruneel,et al.  Discrete-time models for communication systems including ATM , 1992 .

[12]  Jesús R. Artalejo,et al.  A classified bibliography of research on retrial queues: Progress in 1990–1999 , 1999 .

[13]  Jeffrey J. Hunter Discrete Time Models : Techniques and Applications , 1983 .

[14]  Jeffrey J. Hunter,et al.  Mathematical techniques of applied probability , 1985 .

[15]  Robert B. Cooper,et al.  Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..

[16]  M. E. Woodward,et al.  Communication and computer networks - modelling with discrete-time queues , 1993 .

[17]  J. Templeton Retrial queues , 1999 .

[18]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[19]  Marcel F. Neuts,et al.  A service model in which the server is required to search for customers , 1984 .