A Memory-Efficient Bit-Split Pattern Matching Architecture Using Shared Match Vectors for Deep Packet Inspection

被引:4
作者
Kim, HyunJin [1 ]
机构
[1] Dankook Univ, Dept Elect & Elect Eng, Yongin, Gyeonggi Do, South Korea
关键词
computer network security; deep packet inspection; finite state machine; string matching; network monitoring;
D O I
10.1587/transcom.E95.B.3594
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper proposes a bit-split string matcher architecture for a memory-efficient hardware-based parallel pattern matching engine. In the proposed bit-split string matcher, multiple finite-state machine (FSM) tiles share match vectors to reduce the required number of stored match vectors. By decreasing the memory size for storing match vectors, the total memory requirement can be minimized.
引用
收藏
页码:3594 / 3596
页数:3
相关论文
共 6 条
  • [1] AHO AV, 1975, COMMUN ACM, V18, P652
  • [2] A Pattern Partitioning Algorithm for Memory-Efficient Parallel String Matching in Deep Packet Inspection
    Kim, HyunJin
    Hong, Hyejeong
    Baek, Dongmyoung
    Kang, Sungho
    [J]. IEICE TRANSACTIONS ON COMMUNICATIONS, 2010, E93B (06) : 1612 - 1614
  • [3] A Memory-Efficient Pattern Matching with Hardware-Based Bit-Split String Matchers for Deep Packet Inspection
    Kim, Hyunjin
    Kim, Hong-Sik
    Lee, Jung-Hee
    Ahn, Jin-Ho
    Kang, Sungho
    [J]. IEICE TRANSACTIONS ON COMMUNICATIONS, 2010, E93B (02) : 396 - 398
  • [4] Compact state machines for high performance pattern matching
    Piyachon, Piti
    Luo, Yan
    [J]. 2007 44TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2007, : 493 - +
  • [5] *SNORT, INTR DET SYST
  • [6] Tan Lin., 2006, ACM T ARCHIT CODE OP, V3, P3, DOI DOI 10.1145/1132462.1132464