Today's transport is slow. We face extreme challenges in providing low latency in data centers. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from optimal for satisfying latency requirements.
Finishing flows quickly with preemptive scheduling. We propose PDQ, a protocol designed to complete flows quickly by approximating a range of scheduling disciplines via flow preemption. We found PDQ can save ~30% mean flow completion time compared with current transport protocols.
- Finishing Flows Quickly with Preemptive Scheduling
Chi-Yao Hong, Matthew Caesar, P. Brighten Godfrey
- Code of our custom simulator written in C++.