Data center communication networks are characterized by fast and intensive traffic changes, to the extent that a statistical approach to routing has significant drawbacks. This paper proposes the first routing solution that takes into account every data center flow. In order to achieve the required performance, the proposed algorithm operates in the data plane, i.e. in the packet processing pipeline of the programmable packet forwarding chips. Route updates are triggered by the arrival of new flows, and are immediately transferred to the upstream switches in order for them to direct newly arriving flows along the best path. This enables the proposed algorithm to handle fast and intensive traffic changes, such as large-scale flow incast communication patterns which historically presented challenges to the data center routing algorithms. With the explicit knowledge of the current path state, the proposed algorithm can improve routing performance in the data center topologies used today. Additionally, being able to operate with high performance in arbitrary topology, the proposed solution can enable the introduction of new topologies into the data center networks, instead of topologies designed with the goal of supporting equal-cost multipath routing which are dominant in modern data centers.

中文翻译：

---

适用于数据中心网络的拓扑独立多路径路由


数据中心通信网络的特点是流量变化快速且密集，以至于统计路由方法具有显着的缺点。本文提出了第一个考虑到每个数据中心流量的路由解决方案。为了达到所需的性能，所提出的算法在数据平面中运行，即在可编程数据包转发芯片的数据包处理管道中运行。路由更新由新流的到达触发，并立即传输到上游交换机，以便它们沿着最佳路径引导新到达的流。这使得所提出的算法能够处理快速且密集的流量变化，例如大规模流播通信模式，这在历史上对数据中心路由算法提出了挑战。通过对当前路径状态的明确了解，所提出的算法可以提高当今使用的数据中心拓扑中的路由性能。此外，由于能够在任意拓扑中高性能运行，所提出的解决方案可以将新的拓扑引入数据中心网络，而不是为了支持现代数据中心中占主导地位的等成本多路径路由而设计的拓扑。