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
- Part VI Many-Server Systems
- 18 Infinite Servers Revisited
- 19 Asymptotics under Halfin.Whitt Regime
- 20 Many Servers with Abandonment
- 21 Load Balancing in the Supermarket Model
- 22 Parallel Servers with Skill-Based Routing
- References
- Index
21 - Load Balancing in the Supermarket Model
from Part VI - Many-Server Systems
Published online by Cambridge University Press: 01 October 2021
- 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
- Part VI Many-Server Systems
- 18 Infinite Servers Revisited
- 19 Asymptotics under Halfin.Whitt Regime
- 20 Many Servers with Abandonment
- 21 Load Balancing in the Supermarket Model
- 22 Parallel Servers with Skill-Based Routing
- References
- Index
Summary
We study the supermarket model and show that choosing the shortest of just a few randomly chosen queues is almost as good as JSQ. Another issue with many-server systems is specialization, with several customer and server types, and limited compatibility between them
- Type
- Chapter
- Information
- Scheduling and Control of Queueing Networks , pp. 360 - 384Publisher: Cambridge University PressPrint publication year: 2021