Abstract—String matching algorithms are essential for network application devices that filter packets and flows based on their payload. Applications like intrusion detection/ prevention, web filtering, anti-virus, and anti-spam all raise the demand for efficient algorithms dealing with string matching. In this paper, we present a new algorithm for multiple-pattern exact matching. Our approach reduces character comparisons and memory space based on graph transition structure and search technique using dynamic linked list. Theoretical analysis and experimental results, when compared with previously known pattern-matching algorithms, show that our algorithm is highly efficient in both space and time.
Index Terms—Pattern matching, multi-pattern matching, network intrusion detection system.
Dac-Nhuong Le and Nguyen Le Dang are with Haiphong University, Haiphong, Vietnam (e-mail: Nhuongld@hus.edu.vn)
Vinh Trong Le is with the Hanoi University of Science, Vietnam National University, Hanoi, Vietnam.
[PDF]
Cite: Nguyen Le Dang, Dac-Nhuong Le, and Vinh Trong Le, "A New Multiple-Pattern Matching Algorithm for the Network Intrusion Detection System," International Journal of Engineering and Technology vol. 8, no. 2, pp. 94-100, 2016.
