The M/G/1 retrial queue with bernoulli schedule
- 148 Downloads
We consider anM/G/1 retrial queue with infinite waiting space in which arriving customers who find the server busy join either (a) the retrial group with probabilityp in order to seek service again after a random amount of time, or (b) the infinite waiting space with probabilityq(=1−p) where they wait to be served. The joint generating function of the numbers of customers in the two groups is derived by using the supplementary variable method. It is shown that our results are consistent with known results whenp=0 orp=1.
KeywordsRetrial queues supplementary variable method
Unable to display preview. Download preview PDF.
- A.M. Alexandrov, A queueing system with repeated orders, Eng. Cybernet. Rev. 12 (1974) 1.Google Scholar
- Q.H. Choo and B. Conolly, New results in the theory of repeated orders queueing system, J. Appl. Probab. 16 (1979) 631.Google Scholar
- G.I. Falin, A single-line system with secondary orders, Eng. Cybernet. Rev. 17, no. 2 (1979) 76.Google Scholar
- G.I. Falin, Calculation of the load on a shared-use telephone instrument, Moscow Univ. Compt. Math Cybernet. 2 (1981) 59.Google Scholar
- B.S. Greenberg,M/G/1 queueing system with returning customers, J. Appl. Probab. 26 (1989) 152.Google Scholar
- P. Hokstad, A supplementary variable technique applied to theM/G/1 queue, Scand. J. Stat. 2 (1975) 95.Google Scholar
- V.G. Kulkarni, A game theoretic model for two types of customers competing for service, Oper. Res. Lett. 2 (1983) 119.Google Scholar
- V.G. Kulkarni, Expected waiting times in a multi-class batch arrival retrial queue, J. Appl. Probab. 23 (1986) 144.Google Scholar
- T. Yang and J.G.C. Templeton, A survey on retrial queues, Queueing Systems 2 (1987) 201.Google Scholar