Sirius: Composing Network Function Chains into P4-Capable Edge Gateways
Talkat 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI '24) · 2024-04-16..04-18·
summary
System composes dozens of distinct NF chains into a single P4 program, synthesizing traffic identification tables, pipelining loops via recirculations, and partitioning to CPU when ASIC memory is insufficient. Implementation generates a switch P4 program (one real instance reaches ~16,000 lines, 248 tables, four pipelines), handles long chains (up to 26 dependency tables, 10 chains per gateway, 127 loops when naively merged), runs synthesis in minutes, and is deployed across hundreds of gateways, cutting developer effort from weeks to minutes.
AI-written summary · about
chapters (9)
- 0:00Sirius and edge gateways
- 1:06Network functions in switches
- 4:15P4 program challenges
- 6:25Sirius architecture
- 8:50Memory and loop constraints
- 10:58Pipelining candidates
- 12:45Partitioning to CPU
- 14:10Evaluation and gains
- 15:12Conclusion
related talks
01h 08mThe Network is the Computer: A Programming Language Perspective
15mWhen P4 Meets Run-to-completion Architecture
19mNet-P4ct: Enhanced WAN Bandwidth Fair Sharing Using P4 Programmable Switches
20mContra: A Programmable System for Performance aware Routing
14mModular Switch Programming Under Resource Constraints
17mHiP4-UPF: Towards High-Performance Comprehensive 5G User Plane Function on P4...
16mCetus: Releasing P4 Programmers from the Chore of Trial and Error Compiling
15mEnabling In-situ Programmability in Network Data Plane: From Architecture to Language
