An optimal and dynamic elephant flow scheduling for SDN-based data center networks

作者：Honghui Li, Hailiang Lu, Xueliang Fu · 发表于：Journal of Intelligent & Fuzzy Systems · 年份：2019 · DOI：10.3233/jifs-179399 · 被引用次数：15 · 研究领域：Software-Defined Networks and 5G、Cloud Computing and Resource Management、IoT and Edge/Fog Computing

With the rapid development of data center network, the traditional traffic scheduling method can easily cause problems such as link congestion and load imbalance. Therefore, this paper proposes a novel dynamic flow scheduling algorithm GA-ACO (Genetic Algorithm and Ant COlony algorithms). GA-ACO algorithm obtains the global perspective of the network under the SDN (Software defined network) architecture. It then calculates the global optimal path for the elephant flow on the congestion link, and reroutes it. Extensive experiments have been executed to evaluate the performance of the proposed GA-ACO algorithm. The simulation results show that, in comparison with ECMP and ACO-SDN algorithm, GA-ACO can not only reduce the maximum link utilization, but also improve the bandwidth effectively.