网络中的门限负载均衡
Threshold Load Balancing in Networks
摘要：
我们研究了网络中基于并发阈值的负载均衡概率协议。在无向图中有n个资源或机器由节点表示，并且m >> n个用户试图通过沿着图的边缘移动来找到可接受的资源。如果负载低于阈值，则用户接受资源。这样的阈值具有直观的含义，例如，作为机器调度方案中的最后期限，并且它们允许在强局部性约束下设计协议。当迁移部分由资源控制，部分由用户控制时，我们的协议可以快速收敛到一个平衡的状态，所有用户都满意。我们表明，收敛是在一些回合，只有对数的m和多项式的图形的结构特性。即使迁移完全由用户控制，我们也得到了类似的结果，收敛到近似平衡的状态。如果我们稍微调整我们协议中的迁移概率，我们也可以快速收敛到平衡状态。
英文摘要：
We study probabilistic protocols for concurrent threshold-based load balancing in networks. There are n resources or machines represented by nodes in an undirected graph and m >> n users that try to find an acceptable resource by moving along the edges of the graph. Users accept a resource if the load is below a threshold. Such thresholds have an intuitive meaning, e.g., as deadlines in a machine scheduling scenario, and they allow the design of protocols under strong locality constraints. When migration is partly controlled by resources and partly by users, our protocols obtain rapid convergence to a balanced state, in which all users are satisfied. We show that convergence is achieved in a number of rounds that is only logarithmic in m and polynomial in structural properties of the graph. Even when migration is fully controlled by users, we obtain similar results for convergence to approximately balanced states. If we slightly adjust the migration probabilities in our protocol, we can also obtain fast convergence to balanced states.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
