$R^{3}$: A Building Block for Disordering-Tolerant Load Balancing in Data Center Networks

Packet-level load balancing has shown its massive potential for long in utilizing super high bisection bandwidth of data center network (DCN). This kind of potential, however, has still not been completely transformed into huge performance enhancement of data transmission. The fundamental reason is that packet-level load balancing can fully utilize the parallel paths of underlying physical network, but suffer from the problem of packet disordering transmission, which greatly impairs the flow-level transmission performance of DCN. This paper explores the root cause of performance impairment generated by packet disordering transmission, and proposes <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$R^{3}$</tex-math></inline-formula>, a solution focusing on “recognizably releasing redundant acknowledgements” as a building block for data center packet-level load balancer. In <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$R^{3}$</tex-math></inline-formula>'s heart, the source leaf switch perceives the global packet loss information and selectively intercepts the redundant acknowledgement packets, thus avoiding the TCP-driven end-host from experiencing frequent window reductions and unnecessary packet retransmissions. Experimental results of numerous simulation tests and real implementations show that, after integrating <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$R^{3}$</tex-math></inline-formula> into the representative data center packet-level load balancing schemes, the transmission performances of both delay-sensitive and throughput-oriented data center flows are significantly improved. Furthermore, <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$R^{3}$</tex-math></inline-formula> is merely implemented by switch, leaving the end hosts and the deployed load balancing scheme totally unchanged.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Services Computing
Published
2025-08-29
DOI
https://doi.org/10.1109/tsc.2025.3603578
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

$R^{3}$: A Building Block for Disordering-Tolerant Load Balancing in Data Center Networks

Jinbin Hu, Xidao Luan, Yuanzhen Hu, Yuchen Wang et al.
1 links
IEEE Transactions on Services Computing
Cloud Computing and Resource Management
article

$R^{3}$: A Building Block for Disordering-Tolerant Load Balancing in Data Center Networks

Jinbin Hu, Xidao Luan, Yuanzhen Hu, Yuchen Wang, Tao Zhang, Yangfan Li, Huirong Jing
article en

Abstract

Packet-level load balancing has shown its massive potential for long in utilizing super high bisection bandwidth of data center network (DCN). This kind of potential, however, has still not been completely transformed into huge performance enhancement of data transmission. The fundamental reason is that packet-level load balancing can fully utilize the parallel paths of underlying physical network, but suffer from the problem of packet disordering transmission, which greatly impairs the flow-level transmission performance of DCN. This paper explores the root cause of performance impairment generated by packet disordering transmission, and proposes <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$R^{3}$</tex-math></inline-formula>, a solution focusing on “recognizably releasing redundant acknowledgements” as a building block for data center packet-level load balancer. In <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$R^{3}$</tex-math></inline-formula>'s heart, the source leaf switch perceives the global packet loss information and selectively intercepts the redundant acknowledgement packets, thus avoiding the TCP-driven end-host from experiencing frequent window reductions and unnecessary packet retransmissions. Experimental results of numerous simulation tests and real implementations show that, after integrating <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$R^{3}$</tex-math></inline-formula> into the representative data center packet-level load balancing schemes, the transmission performances of both delay-sensitive and throughput-oriented data center flows are significantly improved. Furthermore, <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$R^{3}$</tex-math></inline-formula> is merely implemented by switch, leaving the end hosts and the deployed load balancing scheme totally unchanged.

IEEE Transactions on Services ComputingVol. 18(5)
Central South University (CN), Changsha University (CN), Changsha University of Science and Technology (CN)
Openalex Percentile: Top 66%
Cloud Computing and Resource Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.