Central limit theorem for a many-server queue with random service rates

DOI10.1214/07-AAP497zbMath1145.60047arXiv0808.2865MaRDI QIDQ939080

Rami Atar

Publication date: 20 August 2008

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

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

zbMATH Keywords

fairnessheavy trafficcentral limit theoremrandom environmentmany-server queueHalfin-Whitt regimerouting policiessample-path Little's law

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) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Processes in random environments (60K37)

Related Items (6)

Heavy-traffic limits for many-server queues with service interruptions ⋮ A Fair Policy for the G/GI/N Queue with Multiple Server Pools ⋮ A blind policy for equalizing cumulative idleness ⋮ Performance-based routing ⋮ Managing Supply in the On-Demand Economy: Flexible Workers, Full-Time Employees, or Both? ⋮ Balanced routing with partial information in a distributed parallel many-server queueing system

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamic routing in large-scale service systems with heterogeneous servers
• Martingale proofs of many-server heavy-traffic limits for Markovian queues
• The \(G/GI/N\) queue in the Halfin-Whitt regime
• Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic.
• Fluid and diffusion limits for queues in slowly changing environments
• Heavy-Traffic Limits for Queues with Many Exponential Servers
• The multiclass GI/PH/N queue in the Halfin-Whitt regime

This page was built for publication: Central limit theorem for a many-server queue with random service rates