Hostname: page-component-76fb5796d-25wd4 Total loading time: 0 Render date: 2024-04-25T18:52:23.009Z Has data issue: false hasContentIssue false

The M/M/∞ queue in a random environment

Published online by Cambridge University Press:  14 July 2016

C. A. O'Cinneide*
Affiliation:
University of Arkansas
P. Purdue
Affiliation:
University of Kentucky
*
Postal address: Department of Mathematical Sciences, University of Arkansas, Fayetteville, AR 72701, USA.

Abstract

The M/M/∞ queue in a random environment is an infinite-server queue where arrival and service rates are stochastic processes. Here we study the steady-state behavior of such a system. Explicit results are obtained for the factorial moments, the impossibility of a ‘matrix-Poisson' steady-state distribution is demonstrated and two numerical examples are presented.

Type
Research Papers
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.)

Footnotes

∗∗

Present address: Probability and Statistics Program, National Science Foundation, Washington, DC 20550, USA.

Research supported in part by NSF grant MCS-8102215–01.

References

ÇInlar, E. (1975) Introduction to Stochastic Processes. Prentice-Hall, Englewood Cliffs.Google Scholar
Collings, T. and Stonemen, C. (1976) The M/M/8 queue with varying arrival and service rates. Operat. Res. 24, 760773.Google Scholar
Feller, W. (1971) An Introduction to Probability Theory and its Applications. Vol. II, 2nd edn. Wiley, New York.Google Scholar
Neuts, M. F. (1978) Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vector. Adv. Appl. Prob. 10, 185212.Google Scholar
Neuts, M. F. (1981) Matrix Geometric Solutions in Stochastic Models: An Algorithmic Approach. Johns Hopkins University Press, Baltimore, Md.Google Scholar
Ramaswami, V. (1978) The N/G/8 queue. Technical Report, Department of Mathematics, Drexel University, Philadelphia, PA 19104.Google Scholar
Ramaswami, V. and Neuts, M. F. (1980) Some explicit formulas for infinite server queues with phase type arrivals. J. Appl. Prob. 17, 498514.Google Scholar