Hostname: page-component-89b8bd64d-sd5qd Total loading time: 0 Render date: 2026-05-07T05:31:38.947Z Has data issue: false hasContentIssue false
  • English
  • Français

The M/G/1 Retrial Queue With Retrial Rate Control Policy

Published online by Cambridge University Press:  27 July 2009

Bong Dae Choi ,
Kyung Hyune Rhee  and
Kwang Kyu Park
Bong Dae Choi
Affiliation:
Department of Mathematics, Korea Advanced Institute of Science and Technology, 373-1, Kusǒng-dong Yusǒng-gu Taejǒn 305–701, Korea
Kyung Hyune Rhee
Affiliation:
Department of Mathematics, Korea Advanced Institute of Science and Technology, 373-1, Kusǒng-dong Yusǒng-gu Taejǒn 305–701, Korea
Kwang Kyu Park
Affiliation:
Electronics and Telecommunications Research Institute, P.O. Box 8, Daeduk Science Town, Taejǒn, Korea
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider a single-server retrial queueing system where retrial time is inversely proportional to the number of customers in the system. A necessary and sufficient condition for the stability of the system is found. We obtain the Laplace transform of virtual waiting time and busy period. The transient distribution of the number of customers in the system is also obtained.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 7 , Issue 1 , January 1993 , pp. 29 - 46
Copyright
Copyright © Cambridge University Press 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

1.Bertsekas, D. & Gallager, R. (1987). Data network. Englewood Cliffs, NJ: Prentice-Hall.Google Scholar
2.Choi, B.D., Han, D.H., & Falin, G. On the virtual waiting time for M/G/l retrial queue with two types of calls (preprint).Google Scholar
3.Choi, B.D. & Park, K.K. (1990). The M/G/l retrial queue with Bernoulli schedule. Queueing Systems 7: 219–228.CrossRefGoogle Scholar
4.Choi, B.D. & Shin, Y.W. (to appear). Retrial queues with collision arising from unslotted CSMA/CD protocol. Queueing Systems.Google Scholar
5.Falin, G.I. (1979). A single-line system with secondary orders. Engineering Cybernet 17(2): 76–83.Google Scholar
6.Falin, G.I. (1990). A survey of retrial queues. Queueing Systems 7: 127–167.CrossRefGoogle Scholar
7.Falin, G.I. & Fricker, C. (1991). On the virtual waiting time in an M/G/l retrial queue. Journal of Applied Probability 28: 446–460.CrossRefGoogle Scholar
8.Farahmand, K. (1990). Single line queue with repeated demands. Queueing Systems 6: 223–228.CrossRefGoogle Scholar
9.Fayolle, G. (1986). A simple telephone exchange with delayed feedbacks. Traffic Analysis and Computer Performance Evaluation 245–253.Google Scholar
10.Fayolle, G., Gelenbe, E., & Labetoulle, J. (1977). Stability and optimal control of the packet switching broadcast channel. Journal for the Association of Computing Machines 24: 375–553.CrossRefGoogle Scholar
11.Gross, D. & Harris, C. (1985). Fundamental of queueing theory. New York: John Wiley & Sons.Google Scholar
12.Hokstad, P. (1975). A supplementary variable technique applied to M/G/l queue. Scandinavian Journal of Statistics 2: 95–98.Google Scholar
13.Kleinrock, L. (1975). Queueing systems, Vol. 1. New York: John Wiley & Sons.Google Scholar
14.Pakes, A.G. (1969). Some conditions for ergodicity and recurrence of Markov chains. Operations Research 17: 1058–1061.CrossRefGoogle Scholar
15.Stehfest, H. (1970). Algorithm 368 numerical inversion of Laplace transforms. Communications of the Association for Computing Machinery 13: 47–49.CrossRefGoogle Scholar
16.Yang, T. & Templeton, J.G.C. (1987). A survey on retrial queue. Queueing Systems 2: 203–233.CrossRefGoogle Scholar