Book contents
- Frontmatter
- Contents
- Notation
- Introduction
- Part I The Single Queue
- 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
- 15 Join the Shortest Queue in Parallel Servers
- 16 Control in Balanced Heavy Traffic
- 17 MCQN with Discretionary Routing
- Part VI Many-Server Systems
- References
- Index
15 - Join the Shortest Queue in Parallel Servers
from Part V - Diffusion Scaled Balanced Heavy Traffic
Published online by Cambridge University Press: 01 October 2021
Book contents
- Frontmatter
- Contents
- Notation
- Introduction
- Part I The Single Queue
- 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
- 15 Join the Shortest Queue in Parallel Servers
- 16 Control in Balanced Heavy Traffic
- 17 MCQN with Discretionary Routing
- Part VI Many-Server Systems
- References
- Index
Summary
We look at control of networks in balanced heavy traffic. We consider routing to parallel servers; this illustrates our aim to always pool system resources. We also observe state space collapse and biriefly discuss the diffusion limit for MCQN.
- Type
- Chapter
- Information
- Scheduling and Control of Queueing Networks , pp. 259 - 269Publisher: Cambridge University PressPrint publication year: 2021