图上基于邻近度的负载均衡策略的仿真研究
Proximity Based Load Balancing Policies on Graphs: A Simulation Study
摘要：
分布式负载均衡是在一组服务器之间尽可能均匀地分配作业的行为。文献中研究的负载均衡问题主要有两种版本：静态和动态。静态解释导致制定的负载均衡问题的情况下，与作业（球）永远不会离开系统，并积累在服务器（箱），而动态设置处理的情况下，当作业到达并离开系统后，服务完成。本文设计和评估服务器邻近感知作业分配政策治疗负载均衡问题的目标，以减少与作业的通信成本。我们考虑一类基于邻近度感知的二次幂（POT）选择的分配策略，用于将作业分配给服务器，其中服务器互连为n-顶点图G（V，E）。对于静态版本，我们假设每个作业都到达其中一个服务器u。对于动态设置，我们假设G是一个循环图，在每个服务器上的作业到达过程由泊松点过程描述，作业服务时间呈指数分布。对于这两种设置，我们将每个作业分配给服务器u和v中负载最小的服务器，其中v是根据以下两个策略之一选择的：（i）Unif-POT（k）：从u的k跳邻域随机均匀采样服务器v（ii）InvSq-POT（k）：从k中采样服务器v-我们的模拟结果表明，无论是跳邻域的u与概率成正比的平方之间的距离u和v。策略一致地产生负载分布，其非常类似于经典的邻近不经意POT策略的负载分布。
英文摘要：
Distributed load balancing is the act of allocating jobs among a set of servers as evenly as possible. There are mainly two versions of the load balancing problem that have been studied in the literature: static and dynamic. The static interpretation leads to formulating the load balancing problem as a case with jobs (balls) never leaving the system and accumulating at the servers (bins) whereas the dynamic setting deals with the case when jobs arrive and leave the system after service completion. This paper designs and evaluates server proximity aware job allocation policies for treating load balancing problems with a goal to reduce the communication cost associated with the jobs. We consider a class of proximity aware Power of Two (POT) choice based assignment policies for allocating jobs to servers, where servers are interconnected as an n-vertex graph G(V, E). For the static version, we assume each job arrives at one of the servers, u. For the dynamic setting, we assume G to be a circular graph and job arrival process at each server is described by a Poisson point process with the job service time exponentially distributed. For both settings, we then assign each job to the server with minimum load among servers u and v where v is chosen according to one of the following two policies: (i) Unif-POT(k): Sample a server v uniformly at random from k-hop neighborhood of u (ii) InvSq-POT(k): Sample a server v from k-hop neighborhood of u with probability proportional to the inverse square of the distance between u and v. Our simulation results show that both the policies consistently produce a load distribution which is much similar to that of a classical proximity oblivious POT policy.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
