High-speed String Matching for Network Intrusion Detection
Intrusion detection systems are promising techniques to improve internet security. A daunting challenge in the design of internet intrusion detection systems is how to perform high-speed string matching operations. This paper presents a string matching architecture, consisting of software based classifiers and hardware based verifiers. Based on incoming packet contents, the packet classifiers can dramatically reduce the number of strings to be matched and accordingly, feed the packet to a proper verifier to conduct matching. The paper presents the proposed classifier architecture and discusses the trade-offs in the classifier design. In addition, techniques, including multi-threading FSM, high-speed FSM interface circuits and interconnects for high-speed verifier implementation on FPGA platforms are discussed. Experimental results are presented to explore the trade-offs between system performance, strings partition granularity and hardware resource cost.
International Journal of Communication Networks and Distributed Systems
Soewito, Benfano; Mahajan, Ajay Mohan; Weng, Ning; and Wang, Haibo, "High-speed String Matching for Network Intrusion Detection" (2009). Mechanical Engineering Faculty Research. 510.