A pathwise comparison result for parallel queues

arXiv1301.6364MaRDI QIDQ6239093FDOQ6239093

Publication date: 27 January 2013

Abstract: We introduce the appropriate framework for pathwise comparison of multiple server queues under general stationary ergodic assumptions. We show in what sense it is better to have more servers for a system under FCFS ('First Come, First Served') or equivalently, more queues in a system of parallel queues under the JSW ('Join the Shortest Workload') allocation policy. This comparison result is based on the recursive representation of Kiefer and Wolfowitz, and on a non-mass conservative generalization of the Schur-Convex semi-ordering. We also show that the latter result does not hold true in general, for the larger class of systems applying the semi-cyclic allocation policy introduced by Scheller-Wolf in cite{SW03}.

This page was built for publication: A pathwise comparison result for parallel queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6239093)