A blind policy for equalizing cumulative idleness

DOI10.1007/s11134-011-9212-7zbMath1219.68066WikidataQ59313598 ScholiaQ59313598MaRDI QIDQ543552

Rami Atar, Adam Shwartz, Yair Y. Shaki

Publication date: 17 June 2011

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-011-9212-7

zbMATH Keywords

fairness; diffusion limits; Halfin-Whitt regime; blind control; many-server systems

Mathematics Subject Classification ID

93E99: Stochastic systems and control

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

60F17: Functional limit theorems; invariance principles

Related Items

Tightness of invariant distributions of a large-scale flexible service system under a priority discipline, Diffusion-Scale Tightness of Invariant Distributions of a Large-Scale Flexible Service System, Inequity averse optimization in operational research, Systems with large flexible server pools: instability of ``natural load balancing, Routing and Staffing When Servers Are Strategic, A Fair Policy for the G/GI/N Queue with Multiple Server Pools

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Central limit theorem for a many-server queue with random service rates
• Control of systems with flexible multi-server pools: a shadow routing approach
• State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems
• Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
• Efficient Routing in Heavy Traffic Under Partial Sampling of Service Times
• Queue-and-Idleness-Ratio Controls in Many-Server Service Systems
• QUANTIFYING FAIRNESS IN QUEUING SYSTEMS
• Heavy-Traffic Limits for Queues with Many Exponential Servers
• Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers