2007 International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation 2007
DOI: 10.1109/icsamos.2007.4285750
|View full text |Cite
|
Sign up to set email alerts
|

A Memory-Efficient Reconfigurable Aho-Corasick FSM Implementation for Intrusion Detection Systems

Abstract: Abstract-The Aho-Corasick (AC) algorithm is a very flexible and efficient but memory-hungry pattern matching algorithm that can scan the existence of a query string among multiple test strings looking at each character exactly once, making it one of the main options for software-base intrusion detection systems such as SNORT. We present the Split-AC algorithm, which is a reconfigurable variation of the AC algorithm that exploits domain-specific characteristics of Intrusion Detection to reduce considerably the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(10 citation statements)
references
References 17 publications
0
8
0
Order By: Relevance
“…Software DPIs (such as SNORT, Bro, and L7-filter) are detailed described in [29]. For a pattern matching algorithm used in DPI there are two categories: software (KMP [18], BM [20], AC [21] and WM [22]) and hardware (DFA [23], BF [24,25], and CAM). Pattern matching described in [26] is capable of operating at 8Gbps.…”
Section: B Payload Processing Design Of Netfpga-basedmentioning
confidence: 99%
“…Software DPIs (such as SNORT, Bro, and L7-filter) are detailed described in [29]. For a pattern matching algorithm used in DPI there are two categories: software (KMP [18], BM [20], AC [21] and WM [22]) and hardware (DFA [23], BF [24,25], and CAM). Pattern matching described in [26] is capable of operating at 8Gbps.…”
Section: B Payload Processing Design Of Netfpga-basedmentioning
confidence: 99%
“…There are practical difficulties and substantial overheads in implementing a large number of FSMs in hardware. Dimopoulos et al [2007] proposed to divide the 256 alphabets into frequent and infrequent characters based on their frequency counts in the signature set. A full state graph is constructed for frequent characters, where the transition rule table for infrequent characters is implemented using CAM.…”
Section: Related Work On State Graph Reductionmentioning
confidence: 99%
“…The hardware cost of bit-split FSM is obtained from Jung et al [2006]. The performance of CDFA is obtained from Song et al [2008], and the performance of split-AC is obtained from Dimopoulos et al [2007]. For the split-AC method, there can be trade-off between memory cost and control logic.…”
Section: Performance Evaluationmentioning
confidence: 99%
“…This algorithm is for searching strings which is used in [6] and [7]. In [7] a novel algorithm is proposed which results in reducing memory requirement.…”
Section: Aho-corasick Algorithmmentioning
confidence: 99%