Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T11:45:38.342Z Has data issue: false hasContentIssue false

The departure process from a queueing system

Published online by Cambridge University Press:  24 October 2008

F. P. Kelly
Affiliation:
Statistical Laboratory, Cambridge
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Consider a single-server queueing system with a Poisson arrival process at rate λ and positive service requirements independently distributed with common distribution function B(z) and finite expectation

where βλ < 1, i.e. an M/G/1 system. When the queue discipline is first come first served, or last come first served without pre-emption, the stationary departure process is Poisson if and only if G = M (i.e. B(z) = 1 − exp (−z/β)); see (8), (4) and (2). In this paper it is shown that when the queue discipline is last come first served with pre-emption the stationary departure process is Poisson whatever the form of B(z). The method used is adapted from the approach of Takács (10) and Shanbhag and Tambouratzis (9).

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1976