A single server queue in discrete time with customers served in random order

1 December 1972

journal article
Published by Cambridge University Press (CUP) in Journal of Applied Probability

Vol. 9 (4) , 862-867
https://doi.org/10.2307/3212624

Abstract

This paper aims at showing that for the discrete time analogue of the M/G/l queueing model with service in random order and with a traffic intensity ρ > 0, the condition ρ < ∞ is sufficient in order that every customer joining the queue be served eventually, with probability one (Theorem 2).

Keywords

QUEUE
DISCRETE TIME
SERVED
MODEL
CUSTOMERS
INTENSITY Ρ
TIME ANALOGUE
TRAFFIC INTENSITY

This publication has 3 references indexed in Scilit:

One-to-one functions on the positive integers
Journal of Applied Probability, 1970
Are Many 1-1-Functions on the Positive Integers Onto?
Mathematics Magazine, 1968
On queues in which customers are served in random order
Mathematical Proceedings of the Cambridge Philosophical Society, 1962