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.
In this talk, I 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.
Next, I introduce Clocked ACK-Paced Synchronization(CAPS), 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. Finally, I 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. As will be presented, CAPS reduces worst-case queue occupancy by 5-10x across all tested scenarios without throughput loss.
M.Sc. student under the supervision of Prof. Isaac Keslassy.
