期刊文献+

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

Load Balancing Fat-Tree on Long-Lived Flows:Avoiding Congestion in a Data Center Network
下载PDF
导出
摘要 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.
出处 《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
关键词 data center network software-defined networking load balancing network management data center network software-defined networking load balancing network management
  • 相关文献

参考文献16

  • 1C. Guo, H. Wu, K. Tan, L. Shi, Y. Zhang, and S Lu,“DCell: a scalable and fault?tolerant network structure for data center,”in Proc. ACM SIGCOMM, Seattle,USA, Aug. 2008, pp. 75-86. doi:10.1145/1402958.1402968.
  • 2M. Al?Fares, A. Loukissas, and A. Vahdat,“A scalable, commodity data centernetwork architecture,”in Proc. ACM SIGCOMM, Seattle, USA, Aug. 2008, pp.63-74. doi: 10.1145/1402958.1402967.
  • 3R. N. Mysore, A. Pamboris, N. Farrington, N. Huang, P. Miri, S. Radhakrishnan,V. Subramanya, and A. Vahdat,“PortLand: a scalable fault?tolerant layer 2 datacenter network fabric,”in Proc. ACM SIGCOMM, Barcelona, Spain, Aug. 2009,pp. 39-50. doi: 10.1145/1592568.1592575.
  • 4C. Guo, G. Lu, D. Li, H. Wu, X. Zhang, Y. Shi, C. Tian, Y. Zhang, and S. Lu, “BCube: a high performance, server centric network architecture for modular da?ta centers,”in Proc. ACM SIGCOMM, Barcelona, Spain, Aug. 2009, pp. 36-74.doi: 10.1145/1592568.1592577.
  • 5ONF. (2012, Apr. 13). Software?Defined Networking: The New Norm for Networks[Online]. Available: https://www.opennetworking.org/images/stories/downloads/sdn?resources/white?papers/wp?sdn?newnorm.pdf.
  • 6C. Clos,“A study of non?blocking switching networks,”The Bell System Techni?cal Journal, vol. 32, no. 2, pp. 406-424, 1953.
  • 7N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rex?ford, S. Shenker, and J. Turner,“OpenFlow: enabling innovation in campus net?works,”ACM SIGCOMM Computer Communication Review, vol. 38, no. 2, pp.69-74, Apr. 2008. doi: 10.1145/1355734.1355746.
  • 8A. B. Downey,“Evidence for long?tailed distributions in the internet,”in Proc.ACM SIGCOMM Internet Measurement Workshop, San Francisco, USA, Nov.2001, pp. 229-241. doi:10.1145/505202.505230.
  • 9S. Ben Fred, T. Bonald, A. Proutiere, G. Régnié, and J. W. Roberts,“Statisticalbandwidth sharing: a study of congestion at flow level,”in Proc ACM SIGCOMM,San Diego, USA, Aug. 2001, pp. 111-122. doi: 10.1145/383059.383068.
  • 10Ka?Cheong Leung, V. O. K. Li, and Daiqin Yang,“An overview of packet reor?dering in transmission control protocol (TCP): problems, solutions, and chal?lenges,”IEEE Transaction on Parallel and Distributed Systems, vol. 18, no. 4,pp. 522-535, Apr. 2007. doi: 10.1109/TPDS.2007.1011.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部