High Performance Dictionary-Based String Matching for Deep Packet Inspection

—Dictionary-Based String Matching (DBSM) is used in network Deep Packet Inspection (DPI) applications virus scanning [1] and network intrusion detection [2]. We propose the Pipelined Affix Search with Tail Acceleration (PASTA) architecture for solving DBSM with guaranteed worst-case performance. Our PASTA architecture is composed of a Pipelined Affix Search Relay (PASR) followed by a Tail Acceleration Finite Automaton (TAFA). PASR consists of one or more pipelined Binary Search Tree (pBST) modules arranged in a linear array. TAFA is constructed with the Aho-Corasick goto and failure functions [3] in a compact multi-path and multi-stride tree structure. Both PASR and TAFA achieve good memory efficiency

• Type: Journal
• Year: 2010
• Where: INFOCOM
• Authors: Yi-Hua Edward Yang, Hoang Le, Viktor K. Prasanna
• Keywords: Communications, INFOCOM 2010, Pipelined Affix Search, TAFA, Tail Acceleration