Grout # a Graph Router Based on DPDK
summary
A DPDK-based router that implements forwarding as a node graph using the rte_graph library, configurable over a UNIX socket and a CLI that supports scripted startup. It targets layer three forwarding with VRF, NDP/ARP and IP-in-IP, exposes per-node cycle and packet stats, and supports hot-swapping graph objects without stopping worker threads. Measured forwarding reaches about 18M pps (demo also shows ~7M pps per port), code is on GitHub and is now a hosted project on dpdk.org.
AI-written summary · about
chapters (7)
- 0:00Introduction to Grout
- 1:23Project motivation and goals
- 5:51Design and architecture
- 15:48Live demonstration
- 23:24Performance analysis
- 25:06Future work and status
- 29:16Q&A and community
related talks
34mHyperRouter: Lessons Learnt from Building an L4 Load...
31mFlow-based Packet Processing Framework on DPDK and VPP
18mTGW: Operating an Efficient and Resilient Cloud Gateway at Scale
22mMonitoring 400G Traffic in DPDK Using FPGA-Based SmartNIC with RTE Flow
38mTelecom Packet Processing and Correlation Engine Using DPDK
31mCloud Native Network Observability: Treating Routers like Kubernetes Resources
20mContra: A Programmable System for Performance aware Routing
37mEfficient and Flexible Virtual Machine Networking Through eBPF