论文标题
在两层可重构数据中心中安排机会主义链接
Scheduling Opportunistic Links in Two-Tiered Reconfigurable Datacenters
论文作者
论文摘要
可重新配置的光学拓扑正在成为提高数据中心网络效率的有前途的技术。本文考虑了此类可重构数据中心中调度机会链接的问题。我们研究在线设置并旨在最大程度地减少流量完成时间。问题是经典开关调度问题的两层概括。我们提出了一种稳定的匹配算法，该算法为$ 2 \ cdot（2/\ varepsilon+1）$ - 在资源增强模型中，与最佳离线算法相对于最佳的离线算法竞争：在线算法运行$ 2+\ \ \ \ varepsilon $ timess $ timess。我们的算法和结果是相当笼统的，允许不同的链接延迟，还适用于结合固定和可重构链接的混合拓扑。我们的分析基于LP松弛和双重配件。
Reconfigurable optical topologies are emerging as a promising technology to improve the efficiency of datacenter networks. This paper considers the problem of scheduling opportunistic links in such reconfigurable datacenters. We study the online setting and aim to minimize flow completion times. The problem is a two-tier generalization of classic switch scheduling problems. We present a stable-matching algorithm which is $2\cdot (2/\varepsilon+1)$-competitive against an optimal offline algorithm, in a resource augmentation model: the online algorithm runs $2+\varepsilon$ times faster. Our algorithm and result are fairly general and allow for different link delays and also apply to hybrid topologies which combine fixed and reconfigurable links. Our analysis is based on LP relaxation and dual fitting.
