FRCS: Congestion Control in Datacenter Networks Based on Fair Rate Calculation by Switches

Remote Direct Memory Access (RDMA) has been widely deployed in data centers to further reduce latency and CPU overhead. The line rate in data center networks (DCNs) is gradually growing from 40Gbps to 100Gbps and beyond, and more and more flows will be completed in a single round-trip time (RTT). Traditional congestion control mechanism cannot accurately regulate different flow transmission rates in such background, and it will produce an increase in the flow completion time (FCT) and a loss in throughput. In this paper, we propose FRCS, a congestion control algorithm based on direct fair rate computation that enables fast convergence and switch queue emptying. FRCS can also address the victim flow problem during multiple congestion points. To achieve this goal, FRCS adopts different control methods according to the lengths of flows, calculates the flow fair rate using programmable switches, and passes the information back to the sender via ACK. Simulation results show that FRCS, compared to HPCC, not only achieves a lower FCTSlowdown but also reduces the average queue length at switches by more than 50%.

Authors

Institutions

Publication Details

Published
2024-12-13
DOI
https://doi.org/10.1109/iccc62609.2024.10941816
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

FRCS: Congestion Control in Datacenter Networks Based on Fair Rate Calculation by Switches

Peilin Hong, Zheng Tan
Cloud Computing and Resource Management
article

FRCS: Congestion Control in Datacenter Networks Based on Fair Rate Calculation by Switches

Peilin Hong, Zheng Tan
article en

Abstract

Remote Direct Memory Access (RDMA) has been widely deployed in data centers to further reduce latency and CPU overhead. The line rate in data center networks (DCNs) is gradually growing from 40Gbps to 100Gbps and beyond, and more and more flows will be completed in a single round-trip time (RTT). Traditional congestion control mechanism cannot accurately regulate different flow transmission rates in such background, and it will produce an increase in the flow completion time (FCT) and a loss in throughput. In this paper, we propose FRCS, a congestion control algorithm based on direct fair rate computation that enables fast convergence and switch queue emptying. FRCS can also address the victim flow problem during multiple congestion points. To achieve this goal, FRCS adopts different control methods according to the lengths of flows, calculates the flow fair rate using programmable switches, and passes the information back to the sender via ACK. Simulation results show that FRCS, compared to HPCC, not only achieves a lower FCTSlowdown but also reduces the average queue length at switches by more than 50%.

University of Science and Technology of China (CN)
Openalex Percentile: Top 54%
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.