Programmable Calendar Queues for High-speed Packet Scheduling
summary
Claim: calendar queues let switches escalate priorities of buffered packets over time so complex schedulers run at line rate. Implementation maps calendar “days” to FIFO queues, uses marker packet recirculation and head/tail pointers to rotate queues, and can be driven either by dataplane primitives (nanosecond updates) or by the switch CPU (microsecond updates). Prototype emulates LSTF, Fair Queueing and pFabric, evaluates in a simulator and a small testbed, approximates ideal SRPT closely, and uses 32 queues per port in the evaluation as a practical config.
AI-written summary · about
chapters (17)
- 0:00Intro
- 0:25Packet Scheduling
- 1:20Static Priority Limitations
- 2:57Calendar Queues (CQs)
- 4:17Outline
- 4:35Reconfigurable Switches
- 5:27Programmable Calendar Queues (PCOs)
- 6:25Realizing Algorithms using PCOS
- 7:35Example using PCQs: Fair Queueing
- 9:07Example using PCQs: Earliest Deadline First
- 11:18Implementing PCas in hardware
- 13:14Hardware Feasibility
- 14:13Case Study: Coflow Scheduling
- 14:54Coflow Testbed Setup
- 15:14Coflow Scheduling Evaluation
- 15:53Case Study: Burst-friendly Fair Queueing
- 17:21Summary
related talks
13mClubHeap: A High-Speed and Scalable Priority Queue for Programmable Packet Scheduling
25mApproximating Fair Queueing on Reconfigurable Switches
22mEiffel: Efficient and Flexible Software Packet Scheduling
16mGearbox: A Hierarchical Packet Scheduler for Approximate Weighted Fair Queuing
12mTwenty Years After: Hierarchical Core-Stateless Fair Queueing
15mEverything Matters in Programmable Packet Scheduling
16mManaging Congestion Control Heterogeneity on the Internet with Approximate Performance...
13mSifter: An Inversion-Free and Large-Capacity Programmable Packet Scheduler
