Sanidhay Bhambay
The impact of load comparison errors on the power-of-d load balancing
Bhambay, Sanidhay; Mukhopadhyay, Arpan; Vasantam, Thirupathaiah
Authors
Arpan Mukhopadhyay
Dr Thirupathaiah Vasantam thirupathaiah.vasantam@durham.ac.uk
Assistant Professor
Abstract
We consider a system with π unit-rate servers where jobs arrive according a Poisson process with rate ππ (π < 1). In the standard Power-of-π or Pod scheme with π β₯ 2, for each incoming job, a dispatcher samples π servers uniformly at random and sends the incoming job to the least loaded of the π sampled servers. However, in practice, load comparisons may not always be accurate. In this paper, we analyse the effects of noisy load comparisons on the performance
of the Pod scheme. To test the robustness of the Pod scheme against load comparison errors, we assume an adversarial setting where, in the event of an error, the adversary assigns the incoming job to the worst possible server, i.e., the server with the maximum load among the π sampled servers. We consider two error models: load-dependent and load-independent errors. In the load-dependent error model, the adversary has limited power in that it is able to cause an
error with probability π β [0, 1] only when the difference in the minimum and the maximum queue lengths of the π sampled servers is bounded by a constant threshold π β₯ 0. For this type of errors, we show that, in the large system limit, the benefits of the Pod scheme are retained even if π and π are arbitrarily large as long as the system is heavily loaded, i.e., π is close to 1. In the load-independent error model, the adversary is assumed to be more powerful in that it can cause an error with probability π independent of the loads of the sampled servers. For this model, we show that the performance benefits of the Pod scheme are retained only if π β€ 1βπ; for π > 1βπ
we show that the stability region of the system reduces and the system performs poorly in comparison to the random scheme. Our mean-field analysis uses a new approach to characterise fixed points which neither have closed form solutions nor admit any recursion. Furthermore, we develop a generic approach to prove tightness and stability for any state-dependent load balancing scheme.
Citation
Bhambay, S., Mukhopadhyay, A., & Vasantam, T. (2024). The impact of load comparison errors on the power-of-d load balancing. Performance Evaluation, 164, Article 102408. https://doi.org/10.1016/j.peva.2024.102408
Journal Article Type | Article |
---|---|
Acceptance Date | Feb 22, 2024 |
Online Publication Date | Feb 28, 2024 |
Publication Date | 2024-05 |
Deposit Date | May 15, 2024 |
Publicly Available Date | May 15, 2024 |
Journal | Performance Evaluation |
Print ISSN | 0166-5316 |
Electronic ISSN | 1872-745X |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 164 |
Article Number | 102408 |
DOI | https://doi.org/10.1016/j.peva.2024.102408 |
Public URL | https://durham-repository.worktribe.com/output/2441323 |
Files
Published Journal Article
(1.4 Mb)
PDF
Licence
http://creativecommons.org/licenses/by-nc-nd/4.0/
Publisher Licence URL
http://creativecommons.org/licenses/by-nc-nd/4.0/
Copyright Statement
Β© 2024 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license
(http://creativecommons.org/licenses/by-nc-nd/4.0/).
You might also like
On the Capacity Region of a Quantum Switch with Entanglement Purification
(2023)
Presentation / Conference Contribution
A Continuous Variable Quantum Switch
(2022)
Presentation / Conference Contribution
A throughput optimal scheduling policy for a quantum switch
(2022)
Presentation / Conference Contribution
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search