[Submitted on 24 Jul 2026]
Abstract:Data-center congestion control targets high throughput, fair bandwidth allocation, and low latency. Modern transports couple rate computation and packet scheduling into a single feedback loop, converging to near-optimal rates but leaving standing queues that can scale with the number of flows. We argue that separating the two reveals a simpler design point. Given stable feasible rates, the residual queue problem reduces to a timing problem: if every flow's packets arrive at the bottleneck in the correct slot, the link stays busy and the queue stays empty. Clocked ACK-Paced Synchronization CAPS is a lightweight distributed scheduling layer that achieves this by phase-locking each sender's transmissions to ACK-clocked bottleneck slots, with a per-flow correction that compensates for heterogeneous RTTs. We characterize the phase-locked steady state for dumbbell topologies under equal RTT, heterogeneous RTT, and bidirectional traffic, and validate the mechanism on a fat-tree under incast, permutation, and all-to-all traffic. CAPS reduces worst-case queue occupancy by 5-10x across all tested scenarios without throughput loss.
Submission history
From: Isaac Keslassy [view email]
[v1]
Fri, 24 Jul 2026 18:00:25 UTC (794 KB)
0 Comments
Log in to join the conversation.No comments yet. Be the first to share your thoughts.