{"title":"负载比较误差对负载平衡功率的影响","authors":"Sanidhay Bhambay , Arpan Mukhopadhyay , Thirupathaiah Vasantam","doi":"10.1016/j.peva.2024.102408","DOIUrl":null,"url":null,"abstract":"<div><p>We consider a system with <span><math><mi>n</mi></math></span> unit-rate servers where jobs arrive according a Poisson process with rate <span><math><mrow><mi>n</mi><mi>λ</mi></mrow></math></span> (<span><math><mrow><mi>λ</mi><mo><</mo><mn>1</mn></mrow></math></span>). In the standard <em>Power-of-</em><span><math><mi>d</mi></math></span> or Pod scheme with <span><math><mrow><mi>d</mi><mo>≥</mo><mn>2</mn></mrow></math></span>, for each incoming job, a dispatcher samples <span><math><mi>d</mi></math></span> servers uniformly at random and sends the incoming job to the least loaded of the <span><math><mi>d</mi></math></span> 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 <span><math><mi>d</mi></math></span> sampled servers. We consider two error models: <em>load-dependent</em> and <em>load-independent</em> errors. In the load-dependent error model, the adversary has limited power in that it is able to cause an error with probability <span><math><mrow><mi>ϵ</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></mrow></mrow></math></span> only when the difference in the minimum and the maximum queue lengths of the <span><math><mi>d</mi></math></span> sampled servers is bounded by a constant threshold <span><math><mrow><mi>g</mi><mo>≥</mo><mn>0</mn></mrow></math></span>. For this type of errors, we show that, in the large system limit, the benefits of the Pod scheme are retained even if <span><math><mi>g</mi></math></span> and <span><math><mi>ϵ</mi></math></span> are arbitrarily large as long as the system is heavily loaded, i.e., <span><math><mi>λ</mi></math></span> 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 <span><math><mi>ϵ</mi></math></span> 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 <span><math><mrow><mi>ϵ</mi><mo>≤</mo><mn>1</mn><mo>/</mo><mi>d</mi></mrow></math></span>; for <span><math><mrow><mi>ϵ</mi><mo>></mo><mn>1</mn><mo>/</mo><mi>d</mi></mrow></math></span> we show that the stability region of the system reduces and the system performs poorly in comparison to the <em>random scheme</em>. 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.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"164 ","pages":"Article 102408"},"PeriodicalIF":1.0000,"publicationDate":"2024-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166531624000130/pdfft?md5=e219034bb5ef6f93c589b57673e3885d&pid=1-s2.0-S0166531624000130-main.pdf","citationCount":"0","resultStr":"{\"title\":\"The impact of load comparison errors on the power-of-d load balancing\",\"authors\":\"Sanidhay Bhambay , Arpan Mukhopadhyay , Thirupathaiah Vasantam\",\"doi\":\"10.1016/j.peva.2024.102408\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We consider a system with <span><math><mi>n</mi></math></span> unit-rate servers where jobs arrive according a Poisson process with rate <span><math><mrow><mi>n</mi><mi>λ</mi></mrow></math></span> (<span><math><mrow><mi>λ</mi><mo><</mo><mn>1</mn></mrow></math></span>). In the standard <em>Power-of-</em><span><math><mi>d</mi></math></span> or Pod scheme with <span><math><mrow><mi>d</mi><mo>≥</mo><mn>2</mn></mrow></math></span>, for each incoming job, a dispatcher samples <span><math><mi>d</mi></math></span> servers uniformly at random and sends the incoming job to the least loaded of the <span><math><mi>d</mi></math></span> 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 <span><math><mi>d</mi></math></span> sampled servers. We consider two error models: <em>load-dependent</em> and <em>load-independent</em> errors. In the load-dependent error model, the adversary has limited power in that it is able to cause an error with probability <span><math><mrow><mi>ϵ</mi><mo>∈</mo><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></mrow></mrow></math></span> only when the difference in the minimum and the maximum queue lengths of the <span><math><mi>d</mi></math></span> sampled servers is bounded by a constant threshold <span><math><mrow><mi>g</mi><mo>≥</mo><mn>0</mn></mrow></math></span>. For this type of errors, we show that, in the large system limit, the benefits of the Pod scheme are retained even if <span><math><mi>g</mi></math></span> and <span><math><mi>ϵ</mi></math></span> are arbitrarily large as long as the system is heavily loaded, i.e., <span><math><mi>λ</mi></math></span> 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 <span><math><mi>ϵ</mi></math></span> 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 <span><math><mrow><mi>ϵ</mi><mo>≤</mo><mn>1</mn><mo>/</mo><mi>d</mi></mrow></math></span>; for <span><math><mrow><mi>ϵ</mi><mo>></mo><mn>1</mn><mo>/</mo><mi>d</mi></mrow></math></span> we show that the stability region of the system reduces and the system performs poorly in comparison to the <em>random scheme</em>. 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.</p></div>\",\"PeriodicalId\":19964,\"journal\":{\"name\":\"Performance Evaluation\",\"volume\":\"164 \",\"pages\":\"Article 102408\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-02-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0166531624000130/pdfft?md5=e219034bb5ef6f93c589b57673e3885d&pid=1-s2.0-S0166531624000130-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Performance Evaluation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0166531624000130\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Performance Evaluation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166531624000130","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
摘要
我们考虑一个有 n 台单位速率服务器的系统,在这个系统中,作业是按照速率为 nλ (λ<1) 的泊松过程到达的。在 d≥2 的标准 Power-of-d 或 Pod 方案中,对于每个到达的作业,调度员都会随机均匀地抽样 d 台服务器,并将到达的作业发送给 d 台抽样服务器中负载最小的一台。然而,在实际操作中,负载比较不一定总是准确的。本文分析了有噪声的负载比较对 Pod 方案性能的影响。为了测试 Pod 方案对负载比较误差的鲁棒性,我们假设了一个对抗环境,在出现误差的情况下,对抗者会将接收到的任务分配给最差的服务器,即 d 个采样服务器中负载最大的服务器。我们考虑了两种错误模型:与负载相关的错误和与负载无关的错误。在与负载相关的错误模型中,对手的能力有限,只有当 d 台采样服务器的最小队列长度和最大队列长度之差被一个恒定阈值 g≥0 限定时,它才能以概率ϵ∈[0,1]引发错误。对于这类错误,我们的研究表明,在大系统极限中,只要系统负载较重,即使 g 和ϵ 任意大,Pod 方案的优势依然存在,即在与负载无关的错误模型中,假定对手更强大,因为它能以与采样服务器负载无关的概率 ϵ 引发错误。对于这个模型,我们表明,只有当ϵ≤1/d 时,才能保留 Pod 方案的性能优势;当ϵ>1/d 时,我们表明系统的稳定区域缩小,与随机方案相比,系统性能较差。我们的均值场分析采用了一种新方法来描述固定点的特征,这些固定点既没有封闭形式解,也不允许任何递归。此外,我们还开发了一种通用方法来证明任何与状态相关的负载平衡方案的严密性和稳定性。
The impact of load comparison errors on the power-of-d load balancing
We consider a system with unit-rate servers where jobs arrive according a Poisson process with rate (). In the standard Power-of- or Pod scheme with , 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 only when the difference in the minimum and the maximum queue lengths of the sampled servers is bounded by a constant threshold . 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 ; for 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.
期刊介绍:
Performance Evaluation functions as a leading journal in the area of modeling, measurement, and evaluation of performance aspects of computing and communication systems. As such, it aims to present a balanced and complete view of the entire Performance Evaluation profession. Hence, the journal is interested in papers that focus on one or more of the following dimensions:
-Define new performance evaluation tools, including measurement and monitoring tools as well as modeling and analytic techniques
-Provide new insights into the performance of computing and communication systems
-Introduce new application areas where performance evaluation tools can play an important role and creative new uses for performance evaluation tools.
More specifically, common application areas of interest include the performance of:
-Resource allocation and control methods and algorithms (e.g. routing and flow control in networks, bandwidth allocation, processor scheduling, memory management)
-System architecture, design and implementation
-Cognitive radio
-VANETs
-Social networks and media
-Energy efficient ICT
-Energy harvesting
-Data centers
-Data centric networks
-System reliability
-System tuning and capacity planning
-Wireless and sensor networks
-Autonomic and self-organizing systems
-Embedded systems
-Network science