DocumentCode :
3303710
Title :
ParaSplit: A Scalable Architecture on FPGA for Terabit Packet Classification
Author :
Fong, Jeffrey ; Wang, Xiang ; Qi, Yaxuan ; Li, Jun ; Jiang, Weirong
Author_Institution :
Res. Inst. of Inf. Technol., Tsinghua Univ., Beijing, China
fYear :
2012
fDate :
22-24 Aug. 2012
Firstpage :
1
Lastpage :
8
Abstract :
Packet classification is a fundamental enabling function for various applications in switches, routers and firewalls. Due to their performance and scalability limitations, current packet classification solutions are insufficient in ad-dressing the challenges from the growing network bandwidth and the increasing number of new applications. This paper presents a scalable parallel architecture, named Para Split, for high-performance packet classification. We propose a rule set partitioning algorithm based on range-point conversion to reduce the overall memory requirement. We further optimize the partitioning by applying the Simulated Annealing technique. We implement the architecture on a Field Programmable Gate Array (FPGA) to achieve high throughput by exploiting the abundant parallelism in the hardware. Evaluation using real-life data sets including Open Flow-like 11-tuple rules shows that Para Split achieves significant reduction in memory requirement, compared with the-state-of-the-art algorithms such as Hyper Split [6] and EffiCuts [8]. Because of the memory efficiency of Para Split, our FPGA design can support in the on-chip memory multiple engines, each of which contains up to 10K complex rules. As a result, the architecture with multiple Para Split engines in parallel can achieve up to Terabit per second throughput for large and complex rule sets on a single FPGA device.
Keywords :
field programmable gate arrays; memory architecture; parallel architectures; simulated annealing; EffiCuts algorithm; FPGA; HyperSplit algorithm; OpenFlow-like 11-tuple rule; ParaSplit memory efficiency; ParaSplit scalable parallel architecture; data set; field programmable gate array; firewall; memory requirement reduction; on-chip memory multiple engine; range-point conversion; router; rule set partitioning algorithm; simulated annealing technique; switch; terabit packet classification; Clustering algorithms; Complexity theory; Decision trees; Field programmable gate arrays; Partitioning algorithms; Simulated annealing; Throughput; FPGA; OpenFlow; packet classification; terabit;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
High-Performance Interconnects (HOTI), 2012 IEEE 20th Annual Symposium on
Conference_Location :
Santa Clara, CA
Print_ISBN :
978-1-4673-2836-4
Type :
conf
DOI :
10.1109/HOTI.2012.17
Filename :
6299066
Link To Document :
بازگشت