Jul 2026· Anais do LIII Seminário Integrado de Software e Hardware (SEMISH 2026)· pp. 674-685· 0 citations· 16 references
TL;DR
This work argues that applications should participate in congestion control decisions and introduces the starvation ratio (SR), a metric that detects when applications are truly limited by the network.
Abstract
Datacenter performance is often limited by network-centric congestion controls relying on low-level metrics (e.g., packet loss, latency) that misinterpret applications needs. This work argues that applications should participate in congestion control decisions and introduces the starvation ratio (SR), a metric that detects when applications are truly limited by the network. Experimental evaluations within an 11-flow bottleneck scenario on a Linux-based prototype show that asynchronous applications can absorb network variations within a newly identified “silence zone” without degradation, proving conventional controls are overly restrictive. By deploying proactive and reactive mechanisms, our approach consistently reduces Flow Completion Time (FCT) for network-sensitive workloads. Notably, the proactive configuration eliminates micro-recovery delays, keeping the starvation ratio close to zero and reinforcing the baseline protocol through stable congestion window regulation. We conclude that shifting to application-driven signaling aligns network transmission with the receiver’s processing pace, preventing computational underutilization.
This work introduces CSIG, a protocol that delivers precise, multi-bit bottleneck congestion signals via a fixed-length Ethernet header, and proposes Fast Ramp-Up, a congestion control primitive that leverages these bottleneck signals to reduce median RPC latency by 20% and unclaimed bandwidth by 60% in production.
Abhiram Ravi, Nandita Dukkipati, Weiwu Pang et al.· Conference on Applications,...· 0 citations
Initial evaluations demonstrate that PFC-S can reduce the average flow completion time and effectively prevent congestion spreading, and experimental results show that PFC-S provides better protection for victim flows compared to standard PFC, BFC, and HPCC methods.
Wei-Min Gao, Jia-Wei Huang, Qile Wang et al.· Journal of High Speed Networ...· 0 citations
Driven by the requirements of machine learning, cloud storage, and other network-intensive applications, remote direct memory access (RDMA) has been widely adopted in high-speed networks and is gradually being applied to geographically distributed datacenters. However, in cross-datacenter scenarios, long control loop l...
Wenqiang Deng, Jun-Yan Chen, Xue-Feng Huang et al.· Journal of King Saud Univers...· 0 citations
Evaluation on representative workloads demonstrates that P2CS achieves performance comparable to in-network mechanisms while significantly reducing complexity and cost, and requires minimal software changes making it readily deployable in today's datacenter infrastructure.
Ali Munir, Xiao-Lin Pang, Junyi Zhang· Conference on Applications,...· 0 citations
InfiniFlow is presented, a credit-based hop-by-hop flow control method that supports massive VCs with a limited buffer budget via per-port buffer sharing, and introduces a paradigm shift in buffer management: Upstream Allocates Buffer for Downstream (UABD).
Ze-Rui Tian, Sen Liu, Minkun Xue et al.· Conference on Applications,...· 0 citations
Modern AI workloads demand microsecond-scale network reaction times, forcing data centers to offload congestion control algorithms (CCAs) to hardware. Simultaneously, emerging transport standards introduce diverse congestion signals like delay, CSIG, INT, and packet trimming. Understanding hardware-offloaded CCA adapta...
Meet Dadhania, R. K, Saptarshi Samanta et al.· Conference on Applications,...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.