Exploiting Packet-Level Parallelism of Packet Parsing for FPGA-Based Switches
Authors:
- 1 September 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E102.B (9) , 1862-1874
Abstract
FPGA-based switches are appealing nowadays due to the balance between hardware performance and software flexibility. Packet parser, as the foundational component of FPGA-based switches, is to identify and extract specific fields used in forwarding decisions, e.g., destination IP address. However, traditional parsers are too rigid to accommodate new protocols. In addition, FPGAs usually have a much lower clock frequency and fewer hardware resources, compared to ASICs. In this paper, we present PLANET, a programmable packet-level parallel parsing architecture for FPGA-based switches, to overcome these two limitations. First, PLANET has flexible programmability of updating parsing algorithms at run-time. Second, PLANET highly exploits parallelism inside packet parsing to compensate FPGA's low clock frequency and reduces resource consumption with one-block recycling design. We implemented PLANET on an FPGA-based switch prototype with well-integrated datacenter protocols. Evaluation results show that our design can parse packets at up to 100 Gbps, as well as maintain a relative low parsing latency and fewer hardware resources than existing proposals.Keywords
This publication has 26 references indexed in Scilit:
- Guarantee IP lookup performance with FIB explosionACM SIGCOMM Computer Communication Review, 2014
- A Scalable and Modular Architecture for High-Performance Packet ClassificationIEEE Transactions on Parallel and Distributed Systems, 2013
- Design principles for packet parsers2013
- Scalable Ternary Content Addressable Memory implementation using FPGAs2013
- On finding an optimal TCAM encoding scheme for packet classification2013
- Survey and taxonomy of packet classification techniquesACM Computing Surveys, 2005
- Fast hash table lookup using extended bloom filterACM SIGCOMM Computer Communication Review, 2005
- Cuckoo Hashing2001
- High-speed policy-based packet forwarding using efficient multi-dimensional range matchingACM SIGCOMM Computer Communication Review, 1998
- Efficient fair queuing using deficit round-robinIEEE/ACM Transactions on Networking, 1996