Design and Implementation of High-Speed Pattern Matcher Using Multi-Entry Simultaneous Comparator in Network Intrusion Detection System 


Vol. 40,  No. 11, pp. 2169-2177, Nov.  2015


PDF
  Abstract

This paper proposes a new pattern matching module to overcome the increased runtime of previous algorithm using RAM, which was designed to overcome cost limitation of hash-based algorithm using CAM (Content Addressable Memory). By adopting Merge FSM algorithm to reduce the number of state, the proposed module contains state block and entry block to use in RAM. In the proposed module, one input string is compared with multiple entry strings simultaneously using entry block. The effectiveness of the proposed pattern matching unit is verified by executing Snort 2.9 rule set. Experimental results show that the number of memory reads has decreased by 15.8%, throughput has increased by 47.1%, while memory usage has increased by 2.6%, when compared to previous methods.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. Jeon and S. Hwang, "Design and Implementation of High-Speed Pattern Matcher Using Multi-Entry Simultaneous Comparator in Network Intrusion Detection System," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 11, pp. 2169-2177, 2015. DOI: .

[ACM Style]

Myung-Jae Jeon and Sun-Young Hwang. 2015. Design and Implementation of High-Speed Pattern Matcher Using Multi-Entry Simultaneous Comparator in Network Intrusion Detection System. The Journal of Korean Institute of Communications and Information Sciences, 40, 11, (2015), 2169-2177. DOI: .

[KICS Style]

Myung-Jae Jeon and Sun-Young Hwang, "Design and Implementation of High-Speed Pattern Matcher Using Multi-Entry Simultaneous Comparator in Network Intrusion Detection System," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 11, pp. 2169-2177, 11. 2015.