基于流调度选择的DCN动态负载均衡算法

针对数据中心网络(data center network，DCN)动态调度导致的负载不均衡问题，提出了基于流调度选择的动态负载均衡(dynamic load balancing based on flow scheduling selection，DLBFSS)算法。该算法首先计算拥塞链路上各条大流的等价最短路径，并删除不满足流带宽需求的路径；然后计算剩余路径的可用吞吐量，选择可用吞吐量最大的路径作为最优调度路径；最后根据大流的带宽和最优路径的负载定义调度的拥塞概率，将拥塞概率作为大流调度选择的依据。实验结果表明，与传统ECMP（equal-cost multi-path）路由和现有大流调度算法相比，DLBFSS能够减小网络时延，提高流的带宽利用率，保证了更好的负载均衡。

Dynamic load balancing algorithm for DCN based on flow scheduling selection

In order to solve the problems of poor load balancing caused by dynamic scheduling in data center networks(DCN) , this paper proposed a dynamic load balancing algorithm based on flow scheduling selection(DLBFSS) . Firstly, DLBFSS calculates the equal-cost shortest path for each large flow on the congested link and removes the path with insufficient bandwidth. Then, the available throughput of each remaining path for large flows was calculated, and the path with maximum available throughput was selected as the optimal scheduling path. Finally, the congestion probability of each large flow was defined by considering the flow bandwidth and the load of the optimal path, and the congestion probability was used for large flow scheduling selection. The experimental results show that DLBFSS can reduces the network delay, improves the flow bandwidth utilization and ensures load balancing compared with ECMP(equal-cost multi-path) and typical large flow scheduling algorithms.