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

DOI10.1016/J.ORL.2022.10.006OpenAlexW4306655493MaRDI QIDQ2102840FDOQ2102840

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)

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

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

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)