Simple Proofs of Some Folk Theorems for Parallel Queues.
Makowski, Armand M.
MetadataShow full item record
We present simple proofs of some folk theorems for systems of identical single server queues operating in parallel. In particular we establish a monotonicity property in the number of servers, and show that round-robin customer assignment outperforms random customer assignment. The results are couched in terms of stochastic orderings and hold in great generality.