缩短光电混合数据中心网络的重配置时间(扩展摘要)
Reducing Reconfiguration Time in Hybrid Optical-Electrical Datacenter Networks (Extended Abstract)
AI总结:
针对光电混合数据中心网络重配置时间影响收益的问题,提出结合二分法与最小费用流的新型拓扑求解算法,在求解复杂度与最优性间取得平衡,整体性能优于现有算法。
摘要:
我们研究如何缩短光电混合数据中心网络(DCNs)的重配置时间。借助一层光电路交换机(OCSes),光电混合DCNs可重配置其逻辑拓扑以更好地匹配当前流量模式,但重配置时间可能直接影响重配置能力的收益。重配置时间由拓扑求解器运行时间和触发重配置后的网络收敛时间组成。然而,现有拓扑求解器要么算法复杂度高,要么无法最小化重配置开销。\n 本文中,我们提出一种结合二分法与最小费用流(MCF)思想的新型算法,以缩短总重配置时间。我们首次将拓扑求解问题建模为带分段线性费用的MCF问题,在求解器复杂度与解的最优性之间实现了更好的平衡。我们的评估表明,该算法可显著缩短网络收敛时间,同时消耗更少的拓扑求解器运行时间,使其整体性能优于现有算法。我们的代码和测试用例已在公共代码仓库中公开。
英文摘要:
We study how to reduce the reconfiguration time in hybrid optical-electrical Datacenter Networks (DCNs). With a layer of Optical Circuit Switches (OCSes), hybrid optical-electrical DCNs can reconfigure its logical topologies to better match the on-going traffic patterns, but the reconfiguration time may directly affect the benefits of reconfigurability. The reconfiguration time consists of the topology solver running time and the network convergence time after triggering reconfiguration. However, existing topology solvers either incur high algorithmic complexity or fail to minimize the reconfiguration overhead. In this paper, we propose a novel algorithm that combines the ideas of bipartition and Minimum Cost Flow (MCF) to reduce the overall reconfiguration time. For the first time, we formulate the topology solving problem as a MCF problem with piecewise-linear cost, which strikes a better balance between solver complexity and solution optimality. Our evaluation shows that our algorithm can significantly reduce the network convergence time while consuming less topology solver running time, making its overall performance superior to existing algorithms. Our code and test cases are available at a public repository.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。