2012 Proceedings IEEE INFOCOM 2012
DOI: 10.1109/infcom.2012.6195575
|View full text |Cite
|
Sign up to set email alerts
|

Memory-efficient pattern matching architectures using perfect hashing on graphic processing units

Abstract: Memory architectures have been widely adopted in network intrusion detection system for inspecting malicious packets due to their flexibility and scalability. Memory architectures match input streams against thousands of attack patterns by traversing the corresponding state transition table stored in commodity memories. With the increasing number of attack patterns, reducing memory requirement has become critical for memory architectures. In this paper, we propose a novel memory architecture using perfect hash… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
6
0
1

Year Published

2012
2012
2022
2022

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(7 citation statements)
references
References 9 publications
0
6
0
1
Order By: Relevance
“…The approaches to acceleration involve designing efficient pattern-matching algorithms [33,217] , leveraging hardware implementation [40,179,193,202], and program parallelization [222]. The interest in this issue persists in the research community of intrusion detection even until recently [146,171,178,187,270]. Many existing solutions can accelerate the matching with flexible patterns such as regular expressions, achieving a linear time complexity even in the worst case.…”
Section: Detection Methodologiesmentioning
confidence: 99%
“…The approaches to acceleration involve designing efficient pattern-matching algorithms [33,217] , leveraging hardware implementation [40,179,193,202], and program parallelization [222]. The interest in this issue persists in the research community of intrusion detection even until recently [146,171,178,187,270]. Many existing solutions can accelerate the matching with flexible patterns such as regular expressions, achieving a linear time complexity even in the worst case.…”
Section: Detection Methodologiesmentioning
confidence: 99%
“…Then it shows big performance improvement over the original serial Aho-Corasick algorithm. They published the second paper [3] of improving the PFAC by introducing a hash function method.…”
Section: Related Workmentioning
confidence: 99%
“…However, the main drawback of the original Aho-Corasick algorithm, which is based on sequential processing logic is the performance. The solution for the issue about the performance was introduced by Lin et al [2] [3] by introducing a parallel version of the Aho-Corasick algorithm called Parallel Failure-less Aho-Corasick (PFAC) algorithm which runs on GPGPUs.…”
Section: Introductionmentioning
confidence: 99%
“…Lin proposed a memory-efficient patternmatching algorithm with FSM hardware design to reduce the memory requirement of Snort rule sets for inspecting packet contents against thousands of predefined malicious or suspicious patterns [3]. Furthermore, he proposed another memoryefficient architecture using perfect hashing to condense state transition tables without hash collisions [4]. The implemented architecture is on graphic processing units and tested using attack patterns from Snort system and input packets are from DEFCON.…”
mentioning
confidence: 99%