Note--On the Merits of an "Approximation" to the Busy Period of the GI/G/1 Queue
An approximation suggested by D. Gross and C. M. Harris in their book Fundamentals of Queueing Theory for computing the busy period characteristics in the single server queue with renewal input and general i.i.d. service times commonly denoted by GI/G/1 is shown to be lacking in accuracy, and therefore quite undesirable for practical use. Incidentally, we also demonstrate how for a wide subclass of such queues, computations can be done exactly using practical algorithmic methods.
Year of publication: |
1979
|
---|---|
Authors: | Ramaswami, V. ; Lucantoni, David M. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 25.1979, 3, p. 285-289
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | queues: busy period analysis | probability: renewal processes |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Ensuring Access to Emergency Services in the Presence of Long Internet Dial-Up Calls
Ramaswami, V., (2005)
-
Numerical Solution of Piecewise-Stationary Mt-Gt-I Queues
Choudhury, Gagan L., (1997)
-
Numerical Computation of the Moments of a Probability Distribution From Its Transform
Choudhury, Gagan L., (1996)
- More ...