Congestion control in data center networks based on sending rate gradient.

Saved in:

Bibliographic Details
Title:	Congestion control in data center networks based on sending rate gradient.
Authors:	JIANG, Yi¹ jiangyi2012@outlook.com, WU, Xiangjun¹ xjwu999@aliyun.com, ZHANG, Jingwe¹ 1724221216@qq.com
Source:	Computer Engineering & Science / Jisuanji Gongcheng yu Kexue. Feb2026, Vol. 48 Issue 2, p209-215. 7p.
Subjects:	Bandwidth allocation, Computer network protocols, Network performance, Telemetry, Communication infrastructure
Abstract:	To address issues such as insufficient bandwidth utilization, slow convergence speed, and inadequate fairness in multi-flow shared link scenarios with existing RoCE (RDMA over converged Ethernet) network protocols, a dynamic rate adaptive increment algorithm based on sending rate gradient (DRAI) is proposed and improved upon the foundation of the HPCC (high precision congestion control) protocol. First, the switch adds in-band network telemetry (INT) information containing fields such as link capacity and the maximum number of concurrent flows to data packets. Then, the receiver returns ACK packets carrying the same INT information. Finally, the sender calculates the rate gradient at the congestion points using the INT information and employs this as a signal to implement a dynamic additiveincrease factor, adopting a multiplicative-increase multiplicative-decrease (MIMD) rate adjustment strategy to control the sending rate. Experimental results show that, compared to the HPCC protocol, the proposed congestion control algorithm achieves faster convergence and better fairness in multi-flow shared link scenarios. While maintaining comparable short-flow flow completion times (FCTs) to the HPCC protocol, it also reduces the 99th-percentile FCT for long flows in high-load scenarics. [ABSTRACT FROM AUTHOR]
	Copyright of Computer Engineering & Science / Jisuanji Gongcheng yu Kexue is the property of Computer Engineering & Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	To address issues such as insufficient bandwidth utilization, slow convergence speed, and inadequate fairness in multi-flow shared link scenarios with existing RoCE (RDMA over converged Ethernet) network protocols, a dynamic rate adaptive increment algorithm based on sending rate gradient (DRAI) is proposed and improved upon the foundation of the HPCC (high precision congestion control) protocol. First, the switch adds in-band network telemetry (INT) information containing fields such as link capacity and the maximum number of concurrent flows to data packets. Then, the receiver returns ACK packets carrying the same INT information. Finally, the sender calculates the rate gradient at the congestion points using the INT information and employs this as a signal to implement a dynamic additiveincrease factor, adopting a multiplicative-increase multiplicative-decrease (MIMD) rate adjustment strategy to control the sending rate. Experimental results show that, compared to the HPCC protocol, the proposed congestion control algorithm achieves faster convergence and better fairness in multi-flow shared link scenarios. While maintaining comparable short-flow flow completion times (FCTs) to the HPCC protocol, it also reduces the 99th-percentile FCT for long flows in high-load scenarics. [ABSTRACT FROM AUTHOR]
ISSN:	1007130X
DOI:	10.3969/j.issn.1007-130X.2026.02.002