论文标题
凯文(Kevin):基于De Bruijn的拓扑,具有需求感知的链接和贪婪的路线
Kevin: de Bruijn-based topology with demand-aware links and greedy routing
论文作者
论文摘要
我们提出了一种新颖的需求感知的可重新配置的机架到式数据中心网络,该网络通过简单有效的控制平面实现。特别是,凯文(Kevin)通过支持集成和多跳路由以及工作支持计划来有效利用网络容量。为此,凯文(Kevin)依靠本地贪婪路由和小型转发表仅在拓扑重构期间需要本地更新,从而使这种方法非常适合动态网络。具体而言,凯文(Kevin)基于de bruijn拓扑(使用少量的光电开关),其中静态链接通过机会性链接增强。
We propose Kevin, a novel demand-aware reconfigurable rack-to-rack datacenter network realized with a simple and efficient control plane. In particular, Kevin makes effective use of the network capacity by supporting integrated and multi-hop routing as well as work-conserving scheduling. To this end, Kevin relies on local greedy routing with small forwarding tables which require local updates only during topological reconfigurations, making this approach ideal for dynamic networks. Specifically, Kevin is based on a de Bruijn topology (using a small number of optical circuit switches) in which static links are enhanced with opportunistic links.