Power-of-two sampling in redundancy systems: the impact of assignment constraints

DOI10.1016/J.ORL.2022.10.006MaRDI QIDQ2102840zbMATH OpenOpenAlexFDO

Authors Ellen Cardinaels, Sem Borst, Johan S. H. van Leeuwaarden

Publication date 12 December 2022

Published in Operations Research Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2111.05777

zbMATH Keywords

load balancingstochastic comparisonlight trafficpower-of-twoparallel-server systemsredundancy scheduling

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Heavy-traffic universality of redundancy systems with assignment constraints
• The power of slightly more than one sample in randomized load balancing
• Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems
• Universality of power-of-\(d\) load balancing in many-server systems
• On the analysis of randomized load balancing schemes

Cites work

• A general ``power-of-\(d\) dispatching framework for heterogeneous systems
• Balanced Allocations
• Complete resource pooling of a load-balancing policy for a network of battery swapping stations
• Job assignment in large-scale service systems with affinity relations
• Many-server scaling of the N-system under FCFS-ALIS
• Open Queueing Systems in Light Traffic
• Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling
• Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• Queueing with redundant requests: exact analysis
• Redundancy-\(\mathbf{d}\): the power of \(\mathbf{d}\) choices for redundancy
• Scalable load balancing in networked systems: universality properties and stochastic coupling methods
• Supermarket model on graphs
• Symmetry reduction to optimize a graph-based polynomial from queueing theory
• The Effect of Increasing Routing Choice on Resource Pooling

Cited in

(2)

• Heavy-traffic universality of redundancy systems with assignment constraints
• Power-of-two sampling in redundancy systems: the impact of assignment constraints

This page was built for publication: Power-of-two sampling in redundancy systems: the impact of assignment constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102840)