The departure process from a queueing system

Abstract

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).

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 29 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.