Heavy-Traffic Universality of Redundancy Systems with Assignment Constraints
Published Online:5 Dec 2022https://doi.org/10.1287/opre.2022.2385
- Cited by
- 13 June 2024 | ACM SIGMETRICS Performance Evaluation Review, Vol. 52, No. 1
- 29 May 2024 | Proceedings of the ACM on Measurement and Analysis of Computing Systems, Vol. 8, No. 2
- 11 May 2024 | Queueing Systems, Vol. 106, No. 3-4
Volume 72, Issue 4
July-August 2024
Pages iii-vi, 1317-1750, C2-C3
Article Information
Supplemental Material
Metrics
Information
- Received:May 20, 2021
- Accepted:August 22, 2022
- Published Online:December 05, 2022
Copyright © 2022, INFORMS
Cite as
Ellen Cardinaels, Sem Borst, Johan S. H. van Leeuwaarden (2022) Heavy-Traffic Universality of Redundancy Systems with Assignment Constraints. Operations Research 72(4):1539-1555.
https://doi.org/10.1287/opre.2022.2385
Keywords
The authors thank the two anonymous reviewers and the associate editor for their insightful comments and further thank Céline Comte for helpful discussions that have led to the generalized result in Theorem 2.
