Credence:利用ML预测增强数据中心交换机缓冲区共享
Credence: Augmenting Datacenter Switch Buffer Sharing with ML Predictions
AI总结:
针对数据中心交换机硬件不支持push-out操作导致缓冲区共享性能受限的问题,提出基于机器学习预测增强的drop-tail算法Credence,实现近最优吞吐量并显著降低流完成时间。
摘要:
数据中心交换机中的数据包缓冲区由所有交换机端口共享,以提高整体吞吐量。数据中心交换机缓冲区容量不断缩小的趋势,使得缓冲区共享变得极具挑战性,并成为一个关键的性能问题。文献表明,与drop-tail算法相比,push-out缓冲区共享算法具有显著更好的性能保证。遗憾的是,由于硬件缺乏对push-out操作的支持,交换机无法从这些算法中受益。我们的关键观察是,如果提前知道未来的数据包到达情况,drop-tail缓冲区可以模拟push-out缓冲区。这表明,利用对未来到达情况的预测来增强drop-tail算法,有潜力显著提升性能。本文是这一方向的首次研究尝试。我们提出了Credence,一种利用机器学习预测增强的drop-tail缓冲区共享算法。Credence能够解锁迄今为止仅由push-out算法才能达到的性能。其性能取决于预测的准确性。具体而言,在预测完美时,Credence实现了已知最佳push-out算法LQD(Longest Queue Drop)的近最优性能,而当预测误差任意恶化时,它会优雅地退化为最简单的drop-tail算法Complete Sharing的性能。我们的评估表明,与传统方法相比,Credence将吞吐量提高了1.5倍。在流完成时间方面,我们表明,使用现成的机器学习技术,Credence比最先进的方法最多提升了95%,这些技术在当今的硬件中也是实用的。我们相信这项工作开启了在系统和理论方面若干有趣的未来研究机遇,我们在本文末尾对此进行了讨论。
英文摘要:
Packet buffers in datacenter switches are shared across all the switch ports in order to improve the overall throughput. The trend of shrinking buffer sizes in datacenter switches makes buffer sharing extremely challenging and a critical performance issue. Literature suggests that push-out buffer sharing algorithms have significantly better performance guarantees compared to drop-tail algorithms. Unfortunately, switches are unable to benefit from these algorithms due to lack of support for push-out operations in hardware. Our key observation is that drop-tail buffers can emulate push-out buffers if the future packet arrivals are known ahead of time. This suggests that augmenting drop-tail algorithms with predictions about the future arrivals has the potential to significantly improve performance. This paper is the first research attempt in this direction. We propose Credence, a drop-tail buffer sharing algorithm augmented with machine-learned predictions. Credence can unlock the performance only attainable by push-out algorithms so far. Its performance hinges on the accuracy of predictions. Specifically, Credence achieves near-optimal performance of the best known push-out algorithm LQD (Longest Queue Drop) with perfect predictions, but gracefully degrades to the performance of the simplest drop-tail algorithm Complete Sharing when the prediction error gets arbitrarily worse. Our evaluations show that Credence improves throughput by $1.5$x compared to traditional approaches. In terms of flow completion times, we show that Credence improves upon the state-of-the-art approaches by up to $95\%$ using off-the-shelf machine learning techniques that are also practical in today's hardware. We believe this work opens several interesting future work opportunities both in systems and theory that we discuss at the end of this paper.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。