Critically loaded queueing models that are throughput suboptimal

DOI10.1214/08-AAP551zbMath1221.60130arXiv0906.2305MaRDI QIDQ1024890

Rami Atar, Gennady Shaikhet

Publication date: 17 June 2009

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.2305

zbMATH Keywords

heavy trafficmulti-class queueing systemsscheduling and routingasymptotic null controllabilitybuffer-station graphthroughout optimality

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Scheduling parallel servers in the nondegenerate slowdown diffusion regime: asymptotic optimality results ⋮ Necessary condition for null controllability in many-server heavy traffic

Cites Work

• Queueing systems with many servers: null controllability in heavy traffic
• A diffusion model of scheduling control in queueing systems with many servers
• Heavy traffic resource pooling in parallel-server systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Critically loaded queueing models that are throughput suboptimal