Power-of-two sampling in redundancy systems: the impact of assignment constraints
From MaRDI portal
Publication:2102840
DOI10.1016/j.orl.2022.10.006OpenAlexW4306655493MaRDI QIDQ2102840
Ellen Cardinaels, Johan S. H. van Leeuwaarden, Sem C. Borst
Publication date: 12 December 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.05777
light trafficload balancingstochastic comparisonpower-of-twoparallel-server systemsredundancy scheduling
Cites Work
- Queueing with redundant requests: exact analysis
- Queueing system with selection of the shortest of two queues: An asymptotic approach
- Many-server scaling of the N-system under FCFS-ALIS
- Complete resource pooling of a load-balancing policy for a network of battery swapping stations
- A general ``power-of-\(d\) dispatching framework for heterogeneous systems
- Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview
- Job assignment in large-scale service systems with affinity relations
- Supermarket model on graphs
- Open Queueing Systems in Light Traffic
- Balanced Allocations
- The Effect of Increasing Routing Choice on Resource Pooling
- SCALABLE LOAD BALANCING IN NETWORKED SYSTEMS: UNIVERSALITY PROPERTIES AND STOCHASTIC COUPLING METHODS
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling
- Redundancy-d: The Power of d Choices for Redundancy
- Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory
This page was built for publication: Power-of-two sampling in redundancy systems: the impact of assignment constraints