异构系统中的分布式负载均衡
Distributed Load Balancing in Heterogeneous Systems
摘要:
本文研究了异构并行服务器系统中的分布式负载均衡问题,其中用户在服务器上的服务速率取决于用户和服务器。这种异质性通常出现在无线网络中(例如,服务器可以表示频带,并且用户的服务速率在频带之间变化)。用户以分布式方式选择服务器。它们最初连接到任意服务器。然而,在随机的时刻,它们可能会探测新服务器上的负载并迁移到那里以提高其服务速率。我们分析了自然的随机本地搜索(RLS)迁移计划下,在\cite{sig10}的系统动力学。在这种方案下,当用户有机会切换服务器时,她只有在这提高了她的服务率时才这样做。RLS下的动态可以被解释为在负载均衡游戏中由策略玩家更新其策略所产生的动态。在封闭系统中,用户人口是固定的,我们表明,这个游戏有纯纳什均衡(NE),我们分析了他们的效率。我们进一步证明,当用户人口增长大,纯网元得到更接近比例公平(PF)分配的用户服务器,我们的特点之间的差距均衡和这种理想的分配取决于用户人口。在RLS算法下,系统收敛到纯NE:我们研究了系统在一定范围内达到PF分配所需的时间。在开放系统中,用户随机进入系统并在服务完成后离开,我们确定RLS算法在任何可能的情况下稳定系统,即,它是吞吐量最优的。
英文摘要:
We consider the problem of distributed load balancing in heterogenous parallel server systems, where the service rate achieved by a user at a server depends on both the user and the server. Such heterogeneity typically arises in wireless networks (e.g., servers may represent frequency bands, and the service rate of a user varies across bands). Users select servers in a distributed manner. They initially attach to an arbitrary server. However, at random instants of time, they may probe the load at a new server and migrate there to improve their service rate. We analyze the system dynamics under the natural Random Local Search (RLS) migration scheme, introduced in \cite{sig10}. Under this scheme, when a user has the opportunity to switch servers, she does it only if this improves her service rate. The dynamics under RLS may be interpreted as those generated by strategic players updating their strategy in a load balancing game. In closed systems, where the user population is fixed, we show that this game has pure Nash Equilibriums (NEs), and we analyze their efficiency. We further prove that when the user population grows large, pure NEs get closer to a Proportionally Fair (PF) allocation of users to servers, and we characterize the gap between equilibriums and this ideal allocation depending on user population. Under the RLS algorithm, the system converges to pure NEs: we study the time it takes for the system to reach the PF allocation within a certain margin. In open systems, where users randomly enter the system and leave upon service completion, we establish that the RLS algorithm stabilizes the system whenever this it at all possible, i.e., it is throughput-optimal.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。