Necessary condition for null controllability in many-server heavy traffic

DOI10.1214/13-AAP1001zbMath1311.60108arXiv1501.06277MaRDI QIDQ2258536

Gennady Shaikhet

Publication date: 26 February 2015

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

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

zbMATH Keywords

schedulingheavy trafficnull controllabilityroutingthroughput optimalitysimple pathsmulticlass queueing systemsbuffer-station graph

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Controllability (93B05) 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Control of systems with flexible multi-server pools: a shadow routing approach
• Queueing systems with many servers: null controllability in heavy traffic
• Critically loaded queueing models that are throughput suboptimal
• A diffusion model of scheduling control in queueing systems with many servers
• Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic.
• Heavy traffic resource pooling in parallel-server systems
• Scheduling parallel servers in the nondegenerate slowdown diffusion regime: asymptotic optimality results
• Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic
• Heavy-Traffic Limits for Queues with Many Exponential Servers
• Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule

This page was built for publication: Necessary condition for null controllability in many-server heavy traffic