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
- 10 Multi-Class QueueingNetworks, Instability, and MarkovRepresentations
- 11 Stability of MCQN via Fluid Limits
- 12 Processing Networks and Maximum Pressure Policies
- 13 Processing Networks with Infinite Virtual Queues
- 14 Optimal Control of Transient Networks
- Part V Diffusion Scaled Balanced Heavy Traffic
- Part VI Many-Server Systems
- References
- Index
12 - Processing Networks and Maximum Pressure Policies
from Part IV - Fluid Models of Multi-Class Queueing
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
- 10 Multi-Class QueueingNetworks, Instability, and MarkovRepresentations
- 11 Stability of MCQN via Fluid Limits
- 12 Processing Networks and Maximum Pressure Policies
- 13 Processing Networks with Infinite Virtual Queues
- 14 Optimal Control of Transient Networks
- Part V Diffusion Scaled Balanced Heavy Traffic
- Part VI Many-Server Systems
- References
- Index
Summary
We introduces some more general processing networks and the maximum pressure policy, which uses local information for decentralized control of the network. Maximum pressure policies can guarantee the stability of MCQN as well as of more general processing networks, under some simple structure conditions, whenever traffic intensity rho < 1.
- Type
- Chapter
- Information
- Scheduling and Control of Queueing Networks , pp. 197 - 218Publisher: Cambridge University PressPrint publication year: 2021