Contents

Performance analysis seeks to discover the information bottlenecks in a computer system, and allows the system designer to create an optimal system for a specific need. This book, in the words of the authors, presents a "self-contained and complete presentation of the theory and application of computer performance evaluation based on queueing theory and Markov chains." After beginning with basic probability theory, Queueing Networks and Markov Chains proceeds to the more complicated topics of queueing networks and Markov chains, using applications and examples to illustrate key points.

1. Introduction
2. Markov Chains
3. Steady-State Solution of Markov Chains
4. Steady-State Aggregation/Disaggregation Methods
5. Transient Solution of Markov Chains
6. Single Station Queueing Systems
7. Queueing Networks
8. Algorithms for Product-Form Networks
9. Approximation Algorithms for Product-Form Networks
10. Algorithms for Non-Product-Form Networks
11. Optimization
12. Performance Analysis Tools
13. Applications