Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling
Published Online:2 Mar 2022https://doi.org/10.1287/moor.2021.1248
- Cited by
- 7 August 2025 | Queueing Systems, Vol. 109, No. 3
- 1 March 2024 | Advances in Applied Probability, Vol. 56, No. 3
- 29 May 2024 | Proceedings of the ACM on Measurement and Analysis of Computing Systems, Vol. 8, No. 2
- 2 March 2024 | Queueing Systems, Vol. 106, No. 3-4
- 23 February 2024 | ACM SIGMETRICS Performance Evaluation Review, Vol. 51, No. 4
- 5 January 2024 | ACM SIGMETRICS Performance Evaluation Review, Vol. 51, No. 3
- 1 January 2023 | SSRN Electronic Journal, Vol. 60
- 21 June 2022 | Journal of Applied Probability, Vol. 59, No. 3
- IEEE/ACM Transactions on Networking, Vol. 30, No. 1
Volume 47, Issue 4
November 2022
Pages 2547-3399, C2
Article Information
Supplemental Material
Metrics
Information
- Received:November 12, 2019
- Accepted:December 02, 2021
- Published Online:March 02, 2022
Copyright © 2022, INFORMS
Cite as
Daniela Andrea Hurtado Lange, Siva Theja Maguluri (2022) Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling. Mathematics of Operations Research 47(4):3129-3155.
https://doi.org/10.1287/moor.2021.1248
Keywords
The authors acknowledge professor Mohit Singh for the recommendation of using the least squares problem to prove Theorem 1.
