BurstBalancer: Do Less, Better Balance for Large-scale Data Center Traffic

被引:9
作者
Liu, Zirui [1 ,2 ]
Zhao, Yikai [1 ,2 ]
Fan, Zhuochen [1 ,2 ]
Yang, Tong [1 ,2 ,3 ]
Li, Xiaodong [1 ,2 ]
Zhang, Ruwen [1 ,2 ]
Yang, Kaicheng [1 ,2 ]
Zhong, Zheng [1 ,2 ]
Huang, Yi [4 ]
Liu, Cong [4 ]
Hu, Jing [4 ]
Xie, Gaogang [5 ]
Cui, Bin [1 ,2 ]
机构
[1] Peking Univ, Sch Comp Sci, Beijing, Peoples R China
[2] Peking Univ, Natl Engn Lab Big Data Anal Technol & Applicat, Beijing, Peoples R China
[3] Peng Cheng Lab, Shenzhen, Peoples R China
[4] Huawei Technol, Shenzhen, Peoples R China
[5] Chinese Acad Sci, CNIC, Beijing, Peoples R China
来源
2022 IEEE 30TH INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS (ICNP 2022) | 2022年
基金
中国国家自然科学基金;
关键词
FREQUENT; TIME;
D O I
10.1109/ICNP55882.2022.9940372
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Layer-3 load balancing is a key topic in the networking field. It is well acknowledged that flowlet is the most promising solution because of its good trade-off between load balance and packet reordering. However, we find its one significant limitation: it makes the forwarding paths of flows unpredictable. To address this limitation, this paper presents BurstBalancer, a simple yet efficient load balancing system with a sketch, named BalanceSketch. Our design philosophy is doing less changes to keep the forwarding path of most flows fixed, which guides the design of BalanceSketch and balance operations. We have fully implemented BurstBalancer in a small-scale testbed built with Tofino switches, and conducted large-scale NS-2 simulations. Our results show that BurstBalancer achieves 5%similar to 35% smaller FCT than LetFlow in symmetric topology and up to 30 x smaller FCT in asymmetric topology, while 58 x fewer flows suffer from path changing. All related codes are open-sourced at Github(2).
引用
收藏
页数:13
相关论文
共 93 条
[61]   Homa: A Receiver-Driven Low-Latency Transport Protocol Using Network Priorities [J].
Montazeri, Behnam ;
Li, Yilong ;
Alizadeh, Mohammad ;
Ousterhout, John .
PROCEEDINGS OF THE 2018 CONFERENCE OF THE ACM SPECIAL INTEREST GROUP ON DATA COMMUNICATION (SIGCOMM '18), 2018, :221-235
[62]   Trumpet: Timely and Precise Triggers in Data Centers [J].
Moshref, Masoud ;
Yu, Minlan ;
Govindan, Ramesh ;
Vahdat, Amin .
PROCEEDINGS OF THE 2016 ACM CONFERENCE ON SPECIAL INTEREST GROUP ON DATA COMMUNICATION (SIGCOMM '16), 2016, :129-143
[63]  
pages.cs.wisc.edu, Data Set for IMC 2010 Data Center Measurement
[64]   Fastpass: A Centralized "Zero-Queue" Datacenter Network [J].
Perry, Jonathan ;
Ousterhout, Amy ;
Balakrishnan, Hari ;
Shah, Devavrat ;
Fugal, Hans .
SIGCOMM'14: PROCEEDINGS OF THE 2014 ACM CONFERENCE ON SPECIAL INTEREST GROUP ON DATA COMMUNICATION, 2014, :307-318
[65]   Effective Delay-Controlled Load Distribution over Multipath Networks [J].
Prabhavat, Sumet ;
Nishiyama, Hiroki ;
Ansari, Nirwan ;
Kato, Nei .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2011, 22 (10) :1730-1741
[66]  
Qian F, 2009, IMC'09: PROCEEDINGS OF THE 2009 ACM SIGCOMM INTERNET MEASUREMENT CONFERENCE, P76
[67]  
Radunovic B, 2008, MOBICOM'08: PROCEEDINGS OF THE FOURTEENTH ACM INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING, P247
[68]   Improving Datacenter Performance and Robustness with Multipath TCP [J].
Raiciu, Costin ;
Barre, Sebastien ;
Pluntke, Christopher ;
Greenhalgh, Adam ;
Wischik, Damon ;
Handley, Mark .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2011, 41 (04) :266-277
[69]   Engineering Egress with Edge Fabric Steering Oceans of Content to the World [J].
Schlinker, Brandon ;
Kim, Hyojeong ;
Cui, Timothy ;
Katz-Bassett, Ethan ;
Madhyastha, Harsha V. ;
Cunha, Italo ;
Quinn, James ;
Hasan, Saif ;
Lapukhov, Petr ;
Zeng, Hongyi .
SIGCOMM '17: PROCEEDINGS OF THE 2017 CONFERENCE OF THE ACM SPECIAL INTEREST GROUP ON DATA COMMUNICATION, 2017, :418-431
[70]   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