Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-04T23:02:38.069Z Has data issue: false hasContentIssue false
  • English
  • Français

M/M/∞ transience revisited

Part of: Special processes

Published online by Cambridge University Press:  14 July 2016

J. Preater
J. Preater*
Affiliation:
Keele University
*
∗Postal address: Department of Mathematics, Keele University, Keele, Staffordshire, ST5 5BG, UK.
Get access Rights & Permissions [Opens in a new window]

Abstract

We take a fresh look at some transient characteristics of an M/M/∞ queue, studied previously by Guillemin and Simonian using delicate complex analysis. Along the way we obtain the Laplace transform of the joint distribution of the duration, number of arrivals and swept area associated with a busy period of an M/M/1 queue.

Keywords

QUEUELAPLACE TRANSFORMCONTINUED FRACTION

MSC classification

Primary: 60K25: Queueing theory
Type
Research Papers
Information
Journal of Applied Probability , Volume 34 , Issue 4 , December 1997 , pp. 1061 - 1067
Copyright
Copyright © Applied Probability Trust 1997 

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

[1] Abramovitz, ?. and Stegun, I. A. (1965) A Handbook of Mathematical Functions. Dover, New York.Google Scholar
[2] Aldous, D. (1989) Probability Approximations via the Poisson Clumping Heuristic. Springer, Berlin.Google Scholar
[3] Asmussen, S. (1987) Applied Probability and Queues. Wiley, New York.Google Scholar
[4] Guillemin, F. and Simonian, A. (1995) Transient characteristics of an M/M/8 system. Adv. Appl. Prob. 27, 862–888.Google Scholar
[5] Hall, P. (1988) Introduction to the Theory of Coverage Processes. Wiley, New York.Google Scholar
[6] Shanbhag, D. N. (1966) On infinite server queues with batch arrivals. J. Appl. Prob. 3, 274–279.Google Scholar