Hostname: page-component-89b8bd64d-ksp62 Total loading time: 0 Render date: 2026-05-07T03:33:15.580Z Has data issue: false hasContentIssue false
  • English
  • Français

STABILITY CONDITIONS FOR GATED M/G/∞ QUEUES

Published online by Cambridge University Press:  22 January 2004

Dimitra Pinotsi  and
Michael A. Zazanis
Dimitra Pinotsi
Affiliation:
Department of Statistics, Athens University of Economics and Business, Athens 104 34, Greece, E-mail: zazanis@aueb.gr
Michael A. Zazanis
Affiliation:
Department of Statistics, Athens University of Economics and Business, Athens 104 34, Greece, E-mail: zazanis@aueb.gr
Get access Rights & Permissions [Opens in a new window]

Abstract

The question of stability for the M/G/∞ queue with gated service is investigated using a Foster–Lyapunov drift criterion. The necessary and sufficient condition for positive recurrence is shown to be the finiteness of the first moment of the service time distribution, thus weakening the stability condition given in Browne et al. [3].

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 18 , Issue 1 , January 2004 , pp. 103 - 110
Copyright
© 2004 Cambridge University Press

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

REFERENCES

Asmussen, S. (1987). Applied probability and queues. New York: Wiley.
Avi-Itzhak, B. & Halfin, S. (1989). Response times in gated M/G/1 queues: The processor-sharing case. Queueing Systems 4(3): 263–279.Google Scholar
Browne, S., Coffman, E.G., Jr., Gilbert, E.N., & Wright, P.E. (1992). Gated, exhaustive, parallel service. Probability in the Engineering and Informational Sciences 6: 217–239.Google Scholar
Browne, S., Coffman, E.G., Jr., Gilbert, E.N., & Wright, P.E. (1992). The gated infinite-server queue: Uniform service times. SIAM Journal on Applied Mathematics 52(6): 1751–1762.Google Scholar
Jagerman, D.L. & Sengupta, B. (1989). A functional equation arising in a queue with a gating mechanism. Probability in the Engineering and Informational Sciences 3: 417–433.Google Scholar
Meyn, S.P. & Tweedie, R.L. (1993). Markov chains and stochastic stability. New York: Springer-Verlag.CrossRef
Rege, K.M. & Sengupta, B. (1989). A single server queue with gated processor-sharing discipline. Queueing Systems 4(3): 249–261.Google Scholar
Tan, X. & Knessl, C. (1994). Heavy traffic asymptotics for a gated, infinite-server queue with uniform service times. SIAM Journal of Applied Mathematics 54(6): 1768–1779.Google Scholar
Stoyan, D. (1984). Stochastic ordering. New York: Wiley.
Tweedie, R.L. (2000). Markov chains: Structure and applications. In D.N. Shanbhag & C.R. Rao (eds.), Handbook of statistics, Vol. 19. Amsterdam: Elsevier, pp. 817–851.