CONGA: Distributed Congestion-Aware Load Balancing for Datacenters

被引:77
作者
Alizadeh, Mohammad [1 ]
Edsall, Tom [1 ]
Dharmapurikar, Sarang [1 ]
Vaidyanathan, Ramanan [1 ]
Chu, Kevin [1 ]
Fingerhut, Andy [1 ]
Lam, Vinh The [1 ]
Matus, Francis [1 ]
Pan, Rong [1 ]
Yadav, Navindra [1 ]
Varghese, George [1 ]
机构
[1] Cisco Syst, San Jose, CA 95134 USA
来源
SIGCOMM'14: PROCEEDINGS OF THE 2014 ACM CONFERENCE ON SPECIAL INTEREST GROUP ON DATA COMMUNICATION | 2014年
关键词
Datacenter fabric; Load balancing; Distributed;
D O I
10.1145/2619239.2626316
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We present the design, implementation, and evaluation of CONGA, a network-based distributed congestion-aware load balancing mechanism for datacenters. CONGA exploits recent trends including the use of regular Clos topologies and overlays for network virtualization. It splits TCP flows into flowlets, estimates real-time congestion on fabric paths, and allocates flowlets to paths based on feedback from remote switches. This enables CONGA to efficiently balance load and seamlessly handle asymmetry, without requiring any TCP modifications. CONGA has been implemented in custom ASICs as part of a new datacenter fabric. In testbed experiments, CONGA has 5 x better flow completion times than ECMP even with a single link failure and achieves 2-8 x better throughput than MPTCP in Incast scenarios. Further, the Price of Anarchy for CONGA is provably small in Leaf-Spine topologies; hence CONGA is nearly as effective as a centralized scheduler while being able to react to congestion in microseconds. Our main thesis is that datacenter fabric load balancing is best done in the network, and requires global schemes such as CONGA to handle asymmetry.
引用
收藏
页码:503 / 514
页数:12
相关论文
共 51 条
[41]  
Roughan M., 2003, IMC
[42]  
Roughgarden T., 2005, Selfish Routing and the Price of Anarchy
[43]   Scalable, Optimal Flow Routing in Datacenters via Local Link Balancing [J].
Sen, Siddhartha ;
Shue, David ;
Ihm, Sunghwan ;
Freedman, Michael J. .
PROCEEDINGS OF THE 2013 ACM INTERNATIONAL CONFERENCE ON EMERGING NETWORKING EXPERIMENTS AND TECHNOLOGIES (CONEXT '13), 2013, :151-162
[44]  
Sridharan MurariMark Pearson., 2013, NVGRE: Network virtualization using generic routing encapsulation
[45]  
Varga A, 2001, MODELLING AND SIMULATION 2001, P319
[46]  
Vasudevan V, 2009, SIGCOMM 2009, P303
[47]  
Vutukury S, 1999, COMP COMM R, V29, P227, DOI 10.1145/316194.316227
[48]   COPE: Traffic engineering in dynamic networks [J].
Wang, Hao ;
Xie, Haiyong ;
Qiu, Lili ;
Yang, Yang Richard ;
Zhang, Yin ;
Greenberg, Albert .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2006, 36 (04) :99-110
[49]  
Wischik D., 2011, NSDI, V11, P99
[50]   Link-State Routing With Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering [J].
Xu, Dahai ;
Chiang, Mung ;
Rexford, Jennifer .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2011, 19 (06) :1717-1730