Design Principles for Packet Deparsers on FPGAs
Thomas Luinaud, Jeferson Santiago da Silva, J.M. Pierre Langlois, Yvon, Savaria

TL;DR
This paper introduces design principles and a tool for creating efficient, high-speed packet deparsers on FPGAs, significantly reducing resource usage while achieving over 200 Gbps throughput.
Contribution
It provides the first general design principles for FPGA-based packet deparsers and offers a tool to generate vendor-agnostic architectures from P4 programs.
Findings
Achieves over 200 Gbps throughput on Xilinx Ultrascale+ FPGAs.
Reduces resource usage by nearly 10 times compared to existing solutions.
Validated through simulation and implementation.
Abstract
The P4 language has drastically changed the networking field as it allows to quickly describe and implement new networking applications. Although a large variety of applications can be described with the P4 language, current programmable switch architectures impose significant constraints on P4 programs. To address this shortcoming, FPGAs have been explored as potential targets for P4 applications. P4 applications are described using three abstractions: a packet parser, match-action tables, and a packet deparser, which reassembles the output packet with the result of the match-action tables. While implementations of packet parsers and match-action tables on FPGAs have been widely covered in the literature, no general design principles have been presented for the packet deparser. Indeed, implementing a high-speed and efficient deparser on FPGAs remains an open issue because it requires a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
