Hostname: page-component-848d4c4894-2pzkn Total loading time: 0 Render date: 2024-05-16T18:28:24.303Z Has data issue: false hasContentIssue false
  • English
  • Français

Finiteness of moments of partial busy periods for M/G/C queues

Published online by Cambridge University Press:  14 July 2016

Saeed Ghahramani
Saeed Ghahramani*
Affiliation:
Towson State University
*
∗Postal address: Department of Mathematics, Towson State University, Towson, MD 21204, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

Conditions for finiteness of moments of the following quantities have been found: the duration of a busy period of an Μ /G/∞ system; the duration of a partial busy period of an M/G/C loss system, and the duration of a partial busy period of an M/G/C queue.

Type
Short Communications
Information
Journal of Applied Probability , Volume 23 , Issue 1 , March 1986 , pp. 261 - 264
Copyright
Copyright © Applied Probability Trust 1986 

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.)

References

Kiefer, J. and Wolfowitz, J., (1955) On the theory of queues with many servers. Trans. Amer. Math. Soc. 78, 1–18.CrossRefGoogle Scholar
Kiefer, J. and Wolfowitz, J. (1956) On the characteristics of the general queueing process with applications to random walks. Ann. Math. Statist. 27, 147–161.CrossRefGoogle Scholar
Ramalhoto, M. F. (1984) Bounds for the variance of the busy period of the M/G/8 queue. Adv. Appl. Prob. 16, 929–932.Google Scholar
Takacs, F. (1962) Introduction to the Theory of Queues. Oxford University Press, New York.Google Scholar
Wolff, R. W. (1977) An upper bound for multi-channel queues. J. Appl. Prob. 14, 884–888.CrossRefGoogle Scholar
Wolff, R. W. (1984) Conditions for finite ladder height and delay moments. Operat. Res. 32.Google Scholar