Data center networks are typically characterized by high density communication components that process and exchange large amount of information using shortest paths. Mostly, data centers network topologies contain multi-rooted tree with multiple equal cost shortest paths between pairs of hosts. Usually, data center networks operation is based on the result of shortest path algorithms and per-flow static hashing which may cause poor network utilization rates with some links becoming congested while some parts of the network are underused. This work presents a flow scheduling algorithm that exploits the path diversity in data center topologies and dynamically reroutes large flows through less congested shortest and non-shortest paths based on the current state of the network without causing packets reordering. The algorithm aims to minimize flows latency while maximizing the network utilization rates. Results show that the algorithm proposed in this work reduces flows completion time by 13–24% over Equal-Cost Multi-Path routing, while improving the average network utilization by up to 10%.

数据中心网络通常以高密度通信组件为特征，这些组件使用最短路径来处理和交换大量信息。通常，数据中心网络拓扑包含多根树，在成对的主机之间具有多个等价的最短路径。通常，数据中心网络的运行是基于最短路径算法和每流静态哈希的结果，这可能会导致网络利用率不佳，某些链路变得拥塞，而网络的某些部分却未被充分利用。这项工作提出了一种流调度算法，该算法利用数据中心拓扑中的路径分集，并根据网络的当前状态动态地通过不太拥挤的最短路径和非最短路径重新路由大型流，而不会导致数据包重新排序。该算法旨在最小化流延迟，同时最大化网络利用率。结果表明，与等价多路径路由相比，本文提出的算法将流完成时间减少了13–24％，同时将平均网络利用率提高了10％。