A Pattern Partitioning Algorithm for Memory-Efficient Parallel String Matching in Deep Packet Inspection

被引:8
|
作者
Kim, HyunJin [1 ]
Hong, Hyejeong [1 ]
Baek, Dongmyoung [2 ]
Kang, Sungho [1 ]
机构
[1] Yonsei Univ, Dept Elect & Elect Engn, Seoul 120749, South Korea
[2] ETRI, Broadcasting & Telecommun Convergence Res Lab, Taejon, South Korea
关键词
computer network security; deep packet inspection; finite state machine; pattern matching; and network monitoring;
D O I
10.1587/transcom.E93.B.1612
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper proposes a pattern partitioning algorithm that maps multiple target patterns onto homogeneous memory-based string matchers. The proposed algorithm adopts the greedy search based on lexicographical sorting. By mapping as many target patterns as possible onto each string matcher, the memory requirements are greatly reduced.
引用
收藏
页码:1612 / 1614
页数:3
相关论文
共 50 条
  • [31] NFA-based Pattern Matching for Deep Packet Inspection
    Sun, Yan
    Valgenti, Victor C.
    Kim, Min Sik
    2011 20TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS (ICCCN), 2011,
  • [32] Memory-Efficient Pipelined Architecture for Large-Scale String Matching
    Yang, Yi-Hua E.
    Prasanna, Viktor K.
    PROCEEDINGS OF THE 2009 17TH IEEE SYMPOSIUM ON FIELD PROGRAMMABLE CUSTOM COMPUTING MACHINES, 2009, : 104 - 111
  • [33] Piranha: Fast and memory-efficient pattern matching for intrusion detection
    Antonatos, S
    Polychronakis, M
    Akritidis, P
    Anagnostakis, KG
    Markatos, EP
    SECURITY AND PRIVACY IN THE AGE OF UBIQUITOUS COMPUTING, 2005, 181 : 393 - 408
  • [34] Memory Efficient Parallel Bloom Filters for String Matching
    Li, Yun-Zhao
    NSWCTC 2009: INTERNATIONAL CONFERENCE ON NETWORKS SECURITY, WIRELESS COMMUNICATIONS AND TRUSTED COMPUTING, VOL 1, PROCEEDINGS, 2009, : 485 - 488
  • [35] Piranha: Fast and memory-efficient pattern matching for intrusion detection
    et al; International Communication Foundation; OTSUKA CORPORATION OTSUKA CORPORATION; Support Cent. Adv. Telecommun. Technol. Res.; Systems Development Laboratory,Hitachi Ltd; The Telecommunication Advancement Foundation (Springer Science and Business Media, LLC):
  • [36] High Performance Dictionary-Based String Matching for Deep Packet Inspection
    Yang, Yi-Hua E.
    Le, Hoang
    Prasanna, Viktor K.
    2010 PROCEEDINGS IEEE INFOCOM, 2010,
  • [37] Fast String Matching with Overlapped Substring Classifier in Deep Packet Inspection Systems
    Zhang Zhikai
    Zhao Youjian
    Yang Guanghui
    Zhang Xiaoping
    2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
  • [38] Adaptive Pattern Matching Grammar Generation for use in Deep Packet Inspection
    Menon, Govind
    Katdare, Sanchit
    Phatak, Sagar
    Khengare, Rahul
    UKSIM FIFTH EUROPEAN MODELLING SYMPOSIUM ON COMPUTER MODELLING AND SIMULATION (EMS 2011), 2011, : 119 - 122
  • [39] Beyond Pattern Matching: A Concurrency Model for Stateful Deep Packet Inspection
    De Carli, Lorenzo
    Sommer, Robin
    Jha, Somesh
    CCS'14: PROCEEDINGS OF THE 21ST ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2014, : 1378 - 1390
  • [40] A Hardware-Efficient Pattern Matching Architecture Using Process Element Tree for Deep Packet Inspection
    Ahn, Seongyong
    Hong, Hyejeong
    Kim, HyunJin
    Ahn, Jin-Ho
    Baek, Dongmyong
    Kang, Sungho
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2010, E93B (09) : 2440 - 2442