Book contents
- Frontmatter
- Contents
- Notation
- Introduction
- Part I The Single Queue
- 1 Queues and Their Simulations, Birth and Death Queues
- 2 The M/G/1 Queue
- 3 Scheduling
- Part II Approximations of the Single Queue
- Part III Queueing Networks
- Part IV Fluid Models of Multi-Class Queueing
- Part V Diffusion Scaled Balanced Heavy Traffic
- Part VI Many-Server Systems
- References
- Index
2 - The M/G/1 Queue
from Part I - The Single Queue
Published online by Cambridge University Press: 01 October 2021
Book contents
- Frontmatter
- Contents
- Notation
- Introduction
- Part I The Single Queue
- 1 Queues and Their Simulations, Birth and Death Queues
- 2 The M/G/1 Queue
- 3 Scheduling
- Part II Approximations of the Single Queue
- Part III Queueing Networks
- Part IV Fluid Models of Multi-Class Queueing
- Part V Diffusion Scaled Balanced Heavy Traffic
- Part VI Many-Server Systems
- References
- Index
Summary
We study a queueing system with memoryless Poisson arrivals and generally distributed processing times, the so-called M/G/1 system. Performance measures of this system can be derived exactly, using the principle of work conservation and the property of PASTA (Poisson arrivals see time averages).
- Type
- Chapter
- Information
- Scheduling and Control of Queueing Networks , pp. 16 - 41Publisher: Cambridge University PressPrint publication year: 2021