Detail publikace

Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing

KAŠTIL, J.; KOŘENEK, J.; LENGÁL, O. Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing. 12th EUROMICRO Conference on Digital System Design DSD 2009. Patras: IEEE Computer Society, 2009. s. 823-289. ISBN: 978-0-7695-3782-5.
Název anglicky
Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing
Typ
článek ve sborníku konference
Jazyk
česky
Autoři
Kaštil Jan, Ing., Ph.D.
Kořenek Jan, doc. Ing., Ph.D. (UPSY)
Lengál Ondřej, Ing., Ph.D. (UITS)
Abstrakt

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

Rok
2009
Strany
823–289
Sborník
12th EUROMICRO Conference on Digital System Design DSD 2009
ISBN
978-0-7695-3782-5
Vydavatel
IEEE Computer Society
Místo
Patras
BibTeX 
@inproceedings{BUT33744,
  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",
  booktitle="12th EUROMICRO Conference on Digital System Design DSD 2009",
  year="2009",
  pages="823--289",
  publisher="IEEE Computer Society",
  address="Patras",
  isbn="978-0-7695-3782-5",
  url="https://www.fit.vut.cz/research/publication/9054/"
}
Nahoru