Load Balancing Fat-Tree on Long-Lived Flows:Avoiding Congestion in a Data Center Network  

作　　者：Wen Gao Xuyan Li Boyang Zhou Chunming Wu 

机构地区：[1]College of Computer Science,Zhejiang University

出　　处：《ZTE Communications》2014年第2期57-62,共6页中兴通讯技术（英文版）

基　　金：supported by the National Basic Research Program of China(973 Program)(2012CB315903);the Key Science and Technology Innovation Team Project of Zhejiang Province(2011R50010-05);the National Science and Technology Support Program(2014BAH24F01);863 Program of China(2012AA01A507);the National Natural Science Foundation of China(61379118 and 61103200);sponsored by the Research Fund of ZTE Corporation

摘　　要：In a data center network （DCN）, load balancing is required when servers transfer data on the same path. This is necessary to avoid congestion. Load balancing is challenged by the dynamic transferral of demands and complex routing control. Because of the distributed nature of a traditional network, previous research on load balancing has mostly focused on improving the performance of the local network; thus, the load has not been optimally balanced across the entire network. In this paper, we propose a novel dynamic load-balancing algorithm for fat-tree. This algorithm avoids congestions to the great possible extent by searching for non-conflicting paths in a centralized way. We implement the algorithm in the popular software-defined networking architecture and evaluate the algorithm＇ s performance on the Mininet platform. The results show that our algorithm has higher bisection band- width than the traditional equal-cost multi-path load-balancing algorithm and thus more effectively avoids congestion.In a data center network （DCN）, load balancing is required when servers transfer data on the same path. This is necessary to avoid congestion. Load balancing is challenged by the dynamic transferral of demands and complex routing control. Because of the distributed nature of a traditional network, previous research on load balancing has mostly focused on improving the performance of the local network; thus, the load has not been optimally balanced across the entire network. In this paper, we propose a novel dynamic load-balancing algorithm for fat-tree. This algorithm avoids congestions to the great possible extent by searching for non-conflicting paths in a centralized way. We implement the algorithm in the popular software-defined networking architecture and evaluate the algorithm＇ s performance on the Mininet platform. The results show that our algorithm has higher bisection band- width than the traditional equal-cost multi-path load-balancing algorithm and thus more effectively avoids congestion.

关 键 词：data center network software-defined networking load balancing network management 

分 类 号：TP393.06[自动化与计算机技术—计算机应用技术]