Completed
Fair queuing
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Designing Fast and Programmable Routers
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Traditional network architecture
- 3 One approach: Use a software router
- 4 My work: performance+programmability
- 5 A fixed-function router pipeline
- 6 A programmable atom pipeline
- 7 The Domino compiler
- 8 Designing instruction sets using Domino
- 9 Designing instruction sets: The stateless case
- 10 Designing instruction sets: The stateful case
- 11 Results: computations and their atoms
- 12 Results: A catalog of reusable atoms
- 13 Atoms generalize to unanticipated use cases
- 14 Why programmable scheduling?
- 15 Why is programmable scheduling hard?
- 16 What does the scheduler do?
- 17 A strawman programmable scheduler
- 18 The Push-In First-Out Queue
- 19 A programmable scheduler
- 20 Fair queuing
- 21 Token bucket shaping
- 22 PIFO in hardware
- 23 Outlook and future work
- 24 Co-authors