High Performance Architecture for Flow-Table Lookup in SDN on FPGA

2018/01/02 by Rashid Hatamia, Hatamia, Rashid, Hossein Bahramgiria +3
Computer Science · #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #cs.NI

paper · pdf · doi:10.48550/arxiv.1801.00840

arxiv created 2018/01/02 · arxiv updated 2018/01/04

Abstract

We propose Range-based Ternary Search Tree (RTST), a tree-based approach for flow-table lookup in SDN network. RTST builds upon flow-tables in SDN switches to provide a fast lookup among flows. We present a parallel multi-pipeline architecture for implementing RTST that benefits from high throughput and low latency. The proposed RTST and architecture achieve a memory efficiency of 1 byte of memory for each byte of flow. We also present a set of techniques to support dynamic updates. Experimental results show that RTST can be used to improve the performance of flow-lookup. It achieves a throughput of 670 Million Packets Per Second (MPPS), for a 1 K 15-tuple flow-table, on a state-of-the-art FPGA.

Related

• A Novel FPGA-Based High Throughput Accelerator For Binary Search Trees
• TupleChain: Fast Lookup of OpenFlow Table with Multifaceted Scalability
• Scalable High Performance SDN Switch Architecture on FPGA for Core Networks
• Flow Correlator: A Flow Table Cache Management Strategy
• Many-fields Packet Classification Using R-Tree and Field Concatenation Technique