Job assignment in large-scale service systems with affinity relations
From MaRDI portal
Publication:2297809
DOI10.1007/s11134-019-09633-yzbMath1432.60083arXiv1812.10703OpenAlexW2979666196WikidataQ127100634 ScholiaQ127100634MaRDI QIDQ2297809
Ellen Cardinaels, Johan S. H. van Leeuwaarden, Sem C. Borst
Publication date: 20 February 2020
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.10703
Stochastic network models in operations research (90B15) 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)
Related Items
Scalable Load Balancing in Networked Systems: A Survey of Recent Advances, Power-of-two sampling in redundancy systems: the impact of assignment constraints, Stochastic non-bipartite matching models and order-independent loss queues
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Martingale proofs of many-server heavy-traffic limits for Markovian queues
- Point processes and queues. Martingale dynamics
- On the stability of a partially accessible multi-station queue with state-dependent routing
- Large loss networks
- Dynamic and equilibrium behavior of controlled loss networks
- Queueing system with selection of the shortest of two queues: An asymptotic approach
- Sample path methods in the control of queues
- Heavy traffic resource pooling in parallel-server systems
- Loss Networks
- A simple dynamic routing problem
- Optimality of the shortest line discipline
- Sample Path Criteria for Weak Majorization
- OPTIMAL ROUTING IN OUTPUT-QUEUED FLEXIBLE SERVER SYSTEMS
- The Effect of Increasing Routing Choice on Resource Pooling
- The equilibrium states of large networks of Erlang queues
- Universality of Power-of-d Load Balancing in Many-Server Systems
- SCALABLE LOAD BALANCING IN NETWORKED SYSTEMS: UNIVERSALITY PROPERTIES AND STOCHASTIC COUPLING METHODS
