High-Throughput Stateless-But-Complex Packet Processing Within a Tbps Programmable Switch
Authors:
- 28 October 2024
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-12
Abstract
Programmable switches are promising platforms for fast and flexible in-network computation; however, a standard mechanism, packet recirculation, degrades throughput due to bandwidth consumption caused by the loopback of not only packet headers but also cumbersome payloads. This paper proposes $\mathrm{P}^{4} \text{QRS}$, a mechanism for retaining payloads within the switch, reducing payload recirculations. Specifically, $\mathrm{P}^{4}$ QRS bifurcates packets into headers and payloads, which undergo the computation process through pipelines and the buffering process leveraging the switch's queue behavior, respectively; they then rendezvous for reassembly into complete packets to be sent out. To validate its effectiveness, we evaluated $\mathrm{P}^{4}$ QRS using an analytical model and implementation on state-of-the-art hardware programmable switches. Our evaluation shows that $\mathrm{P}^{4}$ QRS operates stably and intrinsically boosts complex in-switch computations.
Keywords
This publication has 39 references indexed in Scilit:
- A lightweight anonymity protocol at terabit speeds on programmable switchesComputer Networks, 2024
- NVIDIA's Resource Transmutable Network Processing ASIC2023
- D3: Lightweight Secure Fault Localization in Edge Cloud2022
- SFP: Service Function Chain Provision on Programmable Switches for Cloud Tenants2022
- LightNF: Simplifying Network Function Offloading in Programmable Networks2021
- Hardware-Based Evaluation of Scalable and Resilient Multicast With BIER in P4IEEE Access, 2021
- Flow-Aware Service Function Embedding Algorithm in Programmable Data PlaneIEEE Access, 2020
- P4SFC: Service Function Chain Offloading with Programmable Switches2020
- Aggregation of variables in load models for interference-coupled cellular data networks2012
- Efficient fair queuing using deficit round-robinIEEE/ACM Transactions on Networking, 1996