A blind policy for equalizing cumulative idleness
DOI10.1007/S11134-011-9212-7zbMATH Open1219.68066DBLPjournals/questa/AtarSS11OpenAlexW2122943630WikidataQ59313598 ScholiaQ59313598MaRDI QIDQ543552FDOQ543552
Authors: Rami Atar, Yair Y. Shaki, 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
Recommendations
- A fair policy for the \(\mathrm{G}/\mathrm{GI}/N\) queue with multiple server pools
- Blind fair routing in large-scale service systems with heterogeneous customers and servers
- Persistent-idle load-distribution
- Asymptotic optimality of balanced routing
- Achievable performance of blind policies in heavy traffic
Stochastic systems and control (93E99) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Functional limit theorems; invariance principles (60F17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Blind fair routing in large-scale service systems with heterogeneous customers and servers
- Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
- QUANTIFYING FAIRNESS IN QUEUING SYSTEMS
- Queue-and-idleness-ratio controls in many-server service systems
- Control of systems with flexible multi-server pools: a shadow routing approach
- State space collapse in many-server diffusion limits of parallel server systems
- Efficient routing in heavy traffic under partial sampling of service times
- Central limit theorem for a many-server queue with random service rates
Cited In (14)
- Tightness of invariant distributions of a large-scale flexible service system under a priority discipline
- Applications of fluid models in service operations management
- Asymptotically optimal idling in the \(GI/GI/N+GI\) queue
- Routing and staffing when servers are strategic
- A fair policy for the \(\mathrm{G}/\mathrm{GI}/N\) queue with multiple server pools
- Inequity averse optimization in operational research
- Blind fair routing in large-scale service systems with heterogeneous customers and servers
- Diffusion-scale tightness of invariant distributions of a large-scale flexible service system
- Delay-based service differentiation with many servers and time-varying arrival rates
- An analysis of a large-scale machine repair model
- Persistent-idle load-distribution
- Systems with large flexible server pools: instability of ``natural load balancing
- Balanced routing with partial information in a distributed parallel many-server queueing system
- QED limits for many-server systems under a priority policy
This page was built for publication: A blind policy for equalizing cumulative idleness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q543552)
