arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2310.09699cs.NIcs.DC
收藏

在大规模图上快速求解最大最小公平资源分配问题

Solving Max-Min Fair Resource Allocations Quickly on Large Graphs

Pooria Namyar, Behnaz Arzani, Srikanth Kandula, Santiago Segarra, Daniel Crankshaw, Umesh Krishnaswamy, Ramesh Govindan, Himanshu Raj

AI总结:

针对大规模图上的最大最小公平资源分配问题,提出将优化序列转为单一优化并推广水填充法至多路径,新算法更快更公平,在Azure广域网部署实现约3倍加速。

摘要:

我们考虑最大最小公平资源分配问题。已知的最佳解决方案要么使用一系列优化,要么使用仅适用于狭窄情况的水填充法。这些解决方案已成为广域网流量工程和集群调度中的实际瓶颈,尤其是在问题规模较大时。我们改进了这两种方法:(1)我们展示了如何将优化序列转换为单一快速优化,(2)我们将水填充法推广到多路径情况。我们通过实验证明,我们的新算法帕累托支配先前技术:它们产生更快、更公平且更高效的分配。我们的一些分配器还具有理论保证:它们以有限的不公平性换取更快的分配。我们已将我们的分配器部署在 Azure 的广域网流量工程管道中,在那里我们保持了解决方案质量并实现了约 3 倍的加速。

英文摘要:

We consider the max-min fair resource allocation problem. The best-known solutions use either a sequence of optimizations or waterfilling, which only applies to a narrow set of cases. These solutions have become a practical bottleneck in WAN traffic engineering and cluster scheduling, especially at larger problem sizes. We improve both approaches: (1) we show how to convert the optimization sequence into a single fast optimization, and (2) we generalize waterfilling to the multi-path case. We empirically show our new algorithms Pareto-dominate prior techniques: they produce faster, fairer, and more efficient allocations. Some of our allocators also have theoretical guarantees: they trade off a bounded amount of unfairness for faster allocation. We have deployed our allocators in Azure's WAN traffic engineering pipeline, where we preserve solution quality and achieve a roughly $3\times$ speedup.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑