Conference paper

 
Kaštil, J., Kořenek, J., Lengál, O.: Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing, In: 12th EUROMICRO Conference on Digital System Design DSD 2009, Patras, GR, IEEE CS, 2009, p. 823-289, ISBN 978-0-7695-3782-5
Publication language:czech
Original title:Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing
Title (en):Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing
Pages:823-289
Proceedings:12th EUROMICRO Conference on Digital System Design DSD 2009
Conference:12th EUROMICRO Conference on Digital System Design, DSD'2009
Place:Patras, GR
Year:2009
ISBN:978-0-7695-3782-5
Publisher:IEEE Computer Society
Files: 
+Type Name Title Size Modified
icon3782a823.pdf226 KB2012-02-07 09:57:41
^ Select all
With selected:
Keywords
Intrusion detection, regular expression, perfect hashing, hardware acceleration
Annotation
As the speed of current computer networks increases,
it is necessary to protect networks by security systems
such as firewalls and Intrusion Detection Systems operating
at multigigabit speeds. Pattern matching is the time-critical
operation of current IDS on multigigabit networks. Regular
expressions are often used to describe malicious network patterns.
This paper deals with fast regular expression matching using
the Deterministic Finite Automaton (DFA) with perfect hash
function. We introduce decomposition of the problem on two
parts: transformation of the input alphabet and usage of a fast
DFA, and usage of perfect hashing to reduce space/speed tradeoff
for DFA transition table
Abstract
As the speed of current computer networks increases,
it is necessary to protect networks by security systems
such as firewalls and Intrusion Detection Systems operating
at multigigabit speeds. Pattern matching is the time-critical
operation of current IDS on multigigabit networks. Regular
expressions are often used to describe malicious network patterns.
This paper deals with fast regular expression matching using
the Deterministic Finite Automaton (DFA) with perfect hash
function. We introduce decomposition of the problem on two
parts: transformation of the input alphabet and usage of a fast
DFA, and usage of perfect hashing to reduce space/speed tradeoff
for DFA transition table
BibTeX:
@INPROCEEDINGS{
   author = {Jan Kaštil and Jan Kořenek and Ondřej Lengál},
   title = {Methodology for Fast Pattern Matching by Deterministic
	Finite Automaton with Perfect Hashing},
   pages = {823--289},
   booktitle = {12th EUROMICRO Conference on Digital System Design DSD 2009},
   year = {2009},
   location = {Patras, GR},
   publisher = {IEEE Computer Society},
   ISBN = {978-0-7695-3782-5},
   language = {czech},
   url = {http://www.fit.vutbr.cz/research/view_pub.php?id=9054}
}