Abstract
We recall classical queueing networks and their stochastic monotonicity properties as a special case of a general stochastic ordering theory for Markov processes. As a consequence of stochastic monotonicity we present stochastic bounds in transient and stationary conditions for the queue length processes, and some dependence and ordering properties for sojourn times in networks.We overview properties of throughputs in networks in connection with stochastic orderings. Finally we concentrate on dependence orderings for queueing networks with a special attention on the role of routing as a parameter influencing correlation structures in networks. Some connections to the problem of speed of convergence to stationarity via spectral gaps are pointed out.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Szekli, R. (2011). Stochastic Comparison of Queueing Networks. In: Boucherie, R., van Dijk, N. (eds) Queueing Networks. International Series in Operations Research & Management Science, vol 154. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6472-4_8
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6472-4_8
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-6471-7
Online ISBN: 978-1-4419-6472-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)