Abstract
This chapter presents an approach to compare two Queueing Networks. Here one may typically think of one network to be a solvable modification of another unsolvable one of practical interest.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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
Van Dijk, N.M. (2011). Error Bounds and Comparison Results: The Markov Reward Approach For 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_9
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6472-4_9
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)