Managing Congestion Control Heterogeneity on the Internet with Approximate Performance...
summary
Claims a practical multi-queue AQM called Santa that groups flows by inferred throughput–delay preference using packet sojourn time and shuffles them every round (example: 5 s) to promote “naughty” high-throughput flows or demote “nice” delay‑sensitive ones. Prototype runs on a P4 switch with a dedicated mice queue, uses buffer occupancy as the signal, and evaluates nine flows (3×CUBIC, 3×BBR, 3×Vegas) showing small displacement from isolated operating points and approximating Fair Queuing with only a handful of queues.
AI-written summary · about
chapters (10)
- 0:00Congestion control heterogeneity
- 1:44Internet congestion unfairness
- 3:51Beyond bandwidth fairness
- 6:58Performance isolation goal
- 8:44Approximate isolation with queues
- 10:50Santa AQM flow shuffling
- 12:17Santa vs baselines
- 13:46How many queues Santa needs to work
- 14:48Santa limitations and future work
- 15:09Summary
related talks
25mApproximating Fair Queueing on Reconfigurable Switches
12mTwenty Years After: Hierarchical Core-Stateless Fair Queueing
22mProgrammable Calendar Queues for High-speed Packet Scheduling
20mHarmony: A Congestion-free Datacenter Architecture
24mCopa: Practical Delay-Based Congestion Control for the Internet
16mGearbox: A Hierarchical Packet Scheduler for Approximate Weighted Fair Queuing
16mBackpressure Flow Control
16mFlow Scheduling with Imprecise Knowledge