{"title":"Reunion: Receiver-driven network load balancing mechanism in AI training clusters","authors":"Mingyao Wang , Keqiang He , Peirui Cao , Jiong Duan , Dongliang Lv , Zehao Yu , Yanqing Chen , Chengyuan Huang , Wanchun Dou , Guihai Chen , Chen Tian","doi":"10.1016/j.comnet.2025.111088","DOIUrl":null,"url":null,"abstract":"<div><div>RDMA over Converged Ethernet (RoCEv2) enables high-performance networking for large-scale model training but faces challenges due to traffic characteristics such as elephant flows, low entropy, and traffic bursts. Conventional load-balancing techniques like ECMP struggle with hash collisions, causing increased tail latency. Advanced solutions, such as source routing and enhanced ECMP, mitigate these issues but still have hash collisions when there are multiple sources. While packet spraying and flow slicing help alleviate load imbalances due to hash collisions, they can intensify packet reordering issues. Reunion, a novel mechanism for RoCEv2 environments, tackles three critical challenges of flowlet-based rerouting: (1) Rerouting decisions introduce new hash conflicts; (2) The out-of-order packets caused by rerouting has a significant impact on small flows; (3) Setting appropriate flowlet timeout values in high-bandwidth environments is difficult. By utilizing Count-Min-Sketch to filter out small flows and aggregating real-time congestion data, Reunion enables source switches to make dynamic rerouting decisions for elephant flows, minimizing congestion hotspots. Simulations conducted using NS-3 highlight Reunion’s robustness and effectiveness in reducing tail latency. Under varying network loads, Reunion outperforms existing load-balancing schemes such as Conga, LetFlow, ECMP, and ConWeave, achieving tail latency reductions ranging from 10.9% to 62.1%.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"259 ","pages":"Article 111088"},"PeriodicalIF":4.4000,"publicationDate":"2025-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625000568","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
Abstract
RDMA over Converged Ethernet (RoCEv2) enables high-performance networking for large-scale model training but faces challenges due to traffic characteristics such as elephant flows, low entropy, and traffic bursts. Conventional load-balancing techniques like ECMP struggle with hash collisions, causing increased tail latency. Advanced solutions, such as source routing and enhanced ECMP, mitigate these issues but still have hash collisions when there are multiple sources. While packet spraying and flow slicing help alleviate load imbalances due to hash collisions, they can intensify packet reordering issues. Reunion, a novel mechanism for RoCEv2 environments, tackles three critical challenges of flowlet-based rerouting: (1) Rerouting decisions introduce new hash conflicts; (2) The out-of-order packets caused by rerouting has a significant impact on small flows; (3) Setting appropriate flowlet timeout values in high-bandwidth environments is difficult. By utilizing Count-Min-Sketch to filter out small flows and aggregating real-time congestion data, Reunion enables source switches to make dynamic rerouting decisions for elephant flows, minimizing congestion hotspots. Simulations conducted using NS-3 highlight Reunion’s robustness and effectiveness in reducing tail latency. Under varying network loads, Reunion outperforms existing load-balancing schemes such as Conga, LetFlow, ECMP, and ConWeave, achieving tail latency reductions ranging from 10.9% to 62.1%.
期刊介绍:
Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.