Abstract
In this paper, we study the steady-state queue size distribution of the discrete-timeGeo/G/1 retrial queue. We derive analytic formulas for the probability generating function of the number of customers in the system in steady-state. It is shown that the stochastic decomposition law holds for theGeo/G/1 retrial queue. Recursive formulas for the steady-state probabilities are developed. Computations based on these recursive formulas are numerically stable because the recursions involve only nonnegative terms. Since the regularGeo/G/1 queue is a special case of theGeo/G/1 retrial queue, the recursive formulas can also be used to compute the steady-state queue size distribution of the regularGeo/G/1 queue. Furthermore, it is shown that a continuous-timeM/G/1 retrial queue can be approximated by a discrete-timeGeo/G/1 retrial queue by dividing the time into small intervals of equal length and the approximation approaches the exact when the length of the interval tends to zero. This relationship allows us to apply the recursive formulas derived in this paper to compute the approximate steady-state queue size distribution of the continuous-timeM/G/1 retrial queue and the regularM/G/1 queue.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
O.J. Boxma and W.P. Groenendijk, Waiting times in discrete-time cycle-service systems, IEEE Trans. Commun. 36 (1988) 164–170.
H. Bruneel and B.G. Kim,Discrete-Time Models for Communication Systems Including ATM (Kluwer Academic Publishers, Boston, 1993).
B.D. Choi and K.K. Park, The M/G/1 retrial queue for Bernoulli schedule, Queueing Systems 7 (1990) 219–228.
Q.H. Choo and B. Conolly, New results in the theory of repeated orders queueing systems, J. Appl. Prob. 16 (1979) 631.
G.I. Falin, Aggregate arrival of customers in one-line system with repeated calls, Ukr. Math. J. 28 (1976) 437.
G.I. Falin, On the waiting-time process in a single-line queue with repeated calls, J. Appl. Prob. 23 (1986) 185.
G.I. Falin, A survey of retrial queues, Queueing Systems 7 (1990) 127–168.
S. Halfin, Batch delays versus customer delays, Bell Syst. Tech. J. 62(7) (1983) 2011–2015.
J.J. Hunter,Mathematical Techniques of Applied Probability, Vol. 2, Discrete-Time Models: Techniques and Applications (Academic Press, New York, 1983).
J. Keilson, J. Cozzolino, and H. Young, A service system with unfilled requests repeated, Oper. Res. 16 (1968) 1126.
K. Knopp,Infinite Sequences and Series (Dover, New York, 1956).
V.G. Kulkarni, On queueing systems with retrials, J. Appl. Prob. 20 (1983) 380.
V.G. Kulkarni, Expected waiting times in a multiclass batch arrival retrial queue, J. Appl. Prob. 23 (1986) 144.
R. Rom and M. Sidi,Multiple Access Protocols: Performance and Analysis (Springer, New York, 1990).
H. Takagi,Queueing Analysis: A Foundation of Performance Evaluation, Vol. 3, Discrete-Time Systems (North-Holland, Amsterdam, 1993).
T. Yang and J.G.C. Templeton, A survey on retrial queues, Queueing Systems 2 (1987) 201–233.
T. Yang and H. Li, The M/G/1 retrial queue with the server subject to starting failures, Queueing Systems 16 (1994) 83–96.
T. Yang, M.J.M. Posner, J.G.C. Templeton, and H. Li, An approximation method for the M/G/1 retrial queue with general retrial times, Europ. J. Oper. Res. 76 (1994).
Author information
Authors and Affiliations
Additional information
Partially supported by the Natural Sciences and Engineering Research Council of Canada through grant OGP0046415.
Partially supported by the Natural Sciences and Engineering Research Council of Canada through grant OGP0105828.
Rights and permissions
About this article
Cite this article
Yang, T., Li, H. On the steady-state queue size distribution of the discrete-timeGeo/G/1 queue with repeated customers. Queueing Syst 21, 199–215 (1995). https://doi.org/10.1007/BF01158581
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01158581