A LCFS finite buffer model with batch input and non-exponential services
A finite last-come first-served queueing system is studied with batch input and non-exponential services. A closed form expression is obtained for the steady-state queue length distribution and shown to be insensitive to service distributional forms (i.e. to depend only on mean service times). This result is of both practical and theoretical interest as an extension of the standard exponential case.
Year of publication: |
1989
|
---|---|
Authors: | Dijk, Nico M. van |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 33.1989, 1, p. 123-129
|
Publisher: |
Elsevier |
Keywords: | batch input LCFS insensitivity batch balance |
Saved in:
Saved in favorites
Similar items by person
-
Queueing networks : a fundamental approach
Boucherie, Richard J., (2011)
-
"Why waiting always takes too long"
Dijk, Nicolaas M. van, (1995)
-
On uniformization for continuous-time Markov chains
Dijk, Nicolaas M. van, (1995)
- More ...