Heavy-traffic universality of redundancy systems with assignment constraints

DOI10.1287/OPRE.2022.2385MaRDI QIDQ6598916zbMATH OpenFDO

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

Publication date 5 September 2024

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/OPRE.2022.2385

zbMATH Keywords

assignment constraintsheavy-traffic limitheterogeneityload balancingparallel-server systemsredundancy schedulingresource poolingstate space collapse

Mathematics Subject Classification ID

Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Redundancy scheduling with scaled Bernoulli service requirements
• Power-of-two sampling in redundancy systems: the impact of assignment constraints
• Heavy traffic resource pooling in parallel-server systems
• On the Stability of Redundancy Models

Cited in

(3)

• Power-of-two sampling in redundancy systems: the impact of assignment constraints
• Editorial introduction: Special issue on product forms, stochastic matching, and redundancy
• Graph-based product form

This page was built for publication: Heavy-traffic universality of redundancy systems with assignment constraints

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