A blind policy for equalizing cumulative idleness
From MaRDI portal
Publication:543552
DOI10.1007/S11134-011-9212-7zbMath1219.68066DBLPjournals/questa/AtarSS11OpenAlexW2122943630WikidataQ59313598 ScholiaQ59313598MaRDI QIDQ543552
Yair Y. Shaki, Rami Atar, Adam Shwartz
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
Stochastic systems and control (93E99) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Functional limit theorems; invariance principles (60F17)
Related Items (12)
A Fair Policy for the G/GI/N Queue with Multiple Server Pools ⋮ Inequity averse optimization in operational research ⋮ Asymptotically optimal idling in the \(GI/GI/N+GI\) queue ⋮ Systems with large flexible server pools: instability of ``natural load balancing ⋮ Applications of fluid models in service operations management ⋮ An Analysis of a Large-Scale Machine Repair Model ⋮ Delay-Based Service Differentiation with Many Servers and Time-Varying Arrival Rates ⋮ Routing and Staffing When Servers Are Strategic ⋮ QED limits for many-server systems under a priority policy ⋮ Balanced routing with partial information in a distributed parallel many-server queueing system ⋮ 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
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
This page was built for publication: A blind policy for equalizing cumulative idleness
