Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgments
- I Introduction to Queueing
- II Necessary Probability Background
- III The Predictive Power of Simple Operational Laws: “What-If” Questions and Answers
- IV From Markov Chains to Simple Queues
- 8 Discrete-Time Markov Chains
- 9 Ergodicity Theory
- 10 Real-World Examples: Google, Aloha, and Harder Chains
- 11 Exponential Distribution and the Poisson Process
- 12 Transition to Continuous-Time Markov Chains
- 13 M/M/1 and PASTA
- V Server Farms and Networks: Multi-server, Multi-queue Systems
- VI Real-World Workloads: High Variability and Heavy Tails
- VII Smart Scheduling in the M/G/1
- Bibliography
- Index
9 - Ergodicity Theory
from IV - From Markov Chains to Simple Queues
Published online by Cambridge University Press: 05 February 2013
- Frontmatter
- Contents
- Preface
- Acknowledgments
- I Introduction to Queueing
- II Necessary Probability Background
- III The Predictive Power of Simple Operational Laws: “What-If” Questions and Answers
- IV From Markov Chains to Simple Queues
- 8 Discrete-Time Markov Chains
- 9 Ergodicity Theory
- 10 Real-World Examples: Google, Aloha, and Harder Chains
- 11 Exponential Distribution and the Poisson Process
- 12 Transition to Continuous-Time Markov Chains
- 13 M/M/1 and PASTA
- V Server Farms and Networks: Multi-server, Multi-queue Systems
- VI Real-World Workloads: High Variability and Heavy Tails
- VII Smart Scheduling in the M/G/1
- Bibliography
- Index
- Type
- Chapter
- Information
- Performance Modeling and Design of Computer SystemsQueueing Theory in Action, pp. 148 - 189Publisher: Cambridge University PressPrint publication year: 2013