Flow distribution-aware load balancing for the datacenter

被引:16
作者
Wang, Shuo [1 ]
Zhang, Jiao [1 ]
Huang, Tao [1 ,2 ,3 ]
Pan, Tian [1 ]
Liu, Jiang [1 ]
Liu, Yunjie [1 ,2 ]
机构
[1] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China
[2] Beijing Univ Technol, Beijing Adv Innovat Ctr Future Internet Technol, Beijing 100124, Peoples R China
[3] Sci & Technol Informat Transmiss & Disseminat Com, Shijiazhuang 050081, Hebei, Peoples R China
基金
中国国家自然科学基金;
关键词
SDN; Datacenter; Load balancing; ELEPHANT;
D O I
10.1016/j.comcom.2017.03.005
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Leveraging centralized and distributed load balancing algorithm to jointly schedule long and short flows attracts much attention since by classifying flows, they could reduce the completion times of flows without losing the scalability. However, existing centralized-distributed joint algorithms generally classify flows according to a static threshold and are unable to adapt to traffic dynamics. More importantly, through over investigation, the overheads of the controller caused by classifying flows and handling flows can be further reduced. In this paper, we present a Flow Distribution-Aware Load Balancing (FDALB) mechanism to reduce flow completion times and achieve high scalability. In FDALB, flows are split into short flows and long flows according to a threshold. The traffic of short flows and long flows are balanced by distributed and centralized algorithms respectively. To adapt to traffic dynamics, we propose a simple yet effective scheme adaptively adjusting the splitting threshold. To reduce the overheads of classifying flows, FDALB leverages end-hosts to tag long flows, which requires no changes in networking hardware. To further reduce the overheads of handling flows, we proposed a new centralized algorithm without requiring flow rates information. Using realistic datacenter workloads, we show that FDALB reduces the average FCT of flows by up to 47% over ECMP while achieves higher scalability than the state-of-art load balancing mechanism Mahout. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:136 / 146
页数:11
相关论文
共 27 条
[1]  
Al-Fares M., 2010, Hedera: dynamic flow scheduling for data center networks, P19
[2]   A scalable, commodity data center network architecture [J].
Al-Fares, Mohammad ;
Loukissas, Alexander ;
Vahdat, Amin .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2008, 38 (04) :63-74
[3]   CONGA: Distributed Congestion-Aware Load Balancing for Datacenters [J].
Alizadeh, Mohammad ;
Edsall, Tom ;
Dharmapurikar, Sarang ;
Vaidyanathan, Ramanan ;
Chu, Kevin ;
Fingerhut, Andy ;
Vinh The Lam ;
Matus, Francis ;
Pan, Rong ;
Yadav, Navindra ;
Varghese, George .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2014, 44 (04) :503-514
[4]   Data Center TCP (DCTCP) [J].
Alizadeh, Mohammad ;
Greenberg, Albert ;
Maltz, David A. ;
Padhye, Jitendra ;
Patel, Parveen ;
Prabhakar, Balaji ;
Sengupta, Sudipta ;
Sridharan, Murari .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2010, 40 (04) :63-74
[5]  
[Anonymous], 2009, HOTNETS
[6]  
[Anonymous], 8021Q2005 IEEE
[7]  
[Anonymous], 2015, P 12 USENIX S NETWOR
[8]  
Benson A., 2010, P 10 ACM SIGCOMM C I, P267, DOI [10.1145/1879141.1879175.5, DOI 10.1145/1879141.1879175, 10.1145/1879141.1879175]
[9]  
Benson Theophilus, 2010, Computer Communication Review, V40, P92, DOI 10.1145/1592681.1592692
[10]  
Benson Theophilus., 2011, SoCC, P8