Paper Info
Title
A Deterministic Cost-effective String Matching Algorithm for Network Intrusion Detection System
Abstract
Network intrusion detection systems (NIDS) are more and more important in today's network security for identifying and preventing malicious attacks over the network. This paper proposes a novel and effective string matching algorithm (named ACMS) with advantages of both compact memory and high performance. By employing the characteristics of magic states observed from the deterministic finite state automata, the proposed ACMS significantly reduces the memory requirement without sacrificing high speed no matter it is implemented in software or hardware. The ACMS algorithm also provides high flexibility that it can be tuned to fit specific performance requirement and resource constraints. The experimental results show that the performance of ACMS is over 3.5 times in hardware implementation and 21 times in software implementation better than that of the state-of-the-art studies.
Year
DOI
Venue
2007
10.1109/ICC.2007.218
ICC
Keywords
Field
DocType
finite state machines,network security,string matching,deterministic finite state automata,deterministic cost-effective string matching algorithm,network intrusion detection system,magic state algorithm,deterministic automata,telecommunication security,malicious attack,security of data,pattern matching,data structures,algorithm design and analysis,state observer,cost effectiveness,automaton,software performance,intrusion detection,computer science,inspection,hardware,payloads,string
String searching algorithm,Network intrusion detection,Computer science,Automaton,Network security,Telecommunication security,Computer network,Finite-state machine,Software,Software implementation,Distributed computing
Conference
ISSN
ISBN
Citations 
1550-3607
1-4244-0353-7
1
PageRank 
References 
Authors
0.38
12
5
Name
Order
Citations
PageRank
Nen-Fu Huang162072.93
Yen-Ming Chu2708.06
Chen-Ying Hsieh341.15
Chi-Hung Tsai41168.70
Yih-Jou Tzang5505.33