Heavy-traffic universality of redundancy systems with assignment constraints

DOI10.1287/OPRE.2022.2385MaRDI QIDQ6598916FDOQ6598916

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

Publication date: 5 September 2024

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

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

zbMATH Keywords

heterogeneityload balancingheavy-traffic limitresource poolingstate space collapseassignment constraintsparallel-server systemsredundancy scheduling

Mathematics Subject Classification ID

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

Cited In (1)

• Editorial introduction: Special issue on product forms, stochastic matching, and redundancy

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)