On the interchangeability and stochastic ordering of ·/M/1 queues in tandem
- 1 June 1987
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 19 (2) , 515-520
- https://doi.org/10.2307/1427433
Abstract
A probabilistic proof is given of the fact that the departure process from two initially empty. ·/M/1 queues in tandem is unaffected when the service rates are interchanged. As a consequence of this, we show that when the sum of the service rates at the two queues is held constant the departure process stochastically increases as the service rates become equal. The proofs are based on coupling of reflected random walks.Keywords
This publication has 3 references indexed in Scilit:
- On the ordering of tandem queues with exponential serversJournal of Applied Probability, 1986
- ProbabilityPublished by Springer Nature ,1984
- The interchangeability of ·/M/1 queues in seriesJournal of Applied Probability, 1979