%A Wen-Hsuan Liang, Dun-Wei Cheng, Chih-Wei Hsu, Chia-Wei Lee, Chih-Heng Keand, Albert Y. Zomaya, and Sun-Yuan Hsieh %T Dynamic Flow Scheduling Technique for Load Balancing in Fat-Tree Data Center Networks %0 Journal Article %D 2021 %J Int J Performability Eng %R 10.23940/ijpe.21.06.p1.491503 %P 491-503 %V 17 %N 6 %U {https://www.ijpe-online.com/CN/abstract/article_4598.shtml} %8 2021-06-30 %X Modern data center networks for a fat-tree topology typically adopt a multirooted hierarchical tree structure to achieve multiple-path capability and increase bisection bandwidth. However, the performance of a data center network highly depends on the routing protocols. Conventional routing protocols are unsuitable for modern data center topologies because they lack multiple-path routing support. Another crucial concern in data center networks is load balancing. Certain routing protocol limitations could lead to overloaded or underloaded utilization of a link, thereby considerably reducing the performance of a data center network. Therefore, we present a genetic algorithm (GA)-based dynamic load-balancing routing algorithm, which is heuristic and involves the use of a centralized scheduling technique. This algorithm mainly uses a GA to search for optimal solutions. We implement our algorithm in an OpenFlow controller RYU and Mininet emulator, which is based on software-defined networking architecture. Our evaluation results revealed that our algorithm can effectively achieve load balancing and increase bisection bandwidth.