Variable-Stride Multi-Pattern Matching For Scalable Deep Packet Inspection

Abstract—Accelerating multi-pattern matching is a critical issue in building high-performance deep packet inspection systems. Achieving high-throughputs while reducing both memory-usage and memory-bandwidth needs is inherently difficult. In this paper, we propose a pattern (string) matching algorithm that achieves high throughput while limiting both memory-usage and memory-bandwidth. We achieve this by moving away from a byte-oriented processing of patterns to a block-oriented scheme. However, different from previous block-oriented approaches, our scheme uses variable-stride blocks. These blocks can be uniquely identified in both the pattern and in the input stream, hence avoiding the multiplied memory costs which is intrinsic in previous approaches. We present the algorithm, tradeoffs, optimizations, and implementation details. Performance evaluation is done using the Snort and ClamAV pattern sets. Using our algorithm, a single search engine can easily achieve 10-Gbps throughput a...

• Type: Conference
• Year: 2009
• Where: INFOCOM
• Authors: Nan Hua, Haoyu Song, T. V. Lakshman
• Keywords: Block-oriented Scheme, ClamAV Pattern Sets, Communications, INFOCOM 2009, Multi-pattern Matching