Detail publikace
Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing
KAŠTIL, J. KOŘENEK, J. LENGÁL, O.
Originální název
Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing
Český název
Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
cs
Originální 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
Český 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 RIV
2009
Vydáno
05.05.2009
Nakladatel
IEEE Computer Society
Místo
Patras
ISBN
978-0-7695-3782-5
Kniha
12th EUROMICRO Conference on Digital System Design DSD 2009
Edice
NEUVEDEN
Číslo edice
NEUVEDEN
Strany od
823
Strany do
289
Strany počet
6
URL
Dokumenty
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",
annote="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",
address="IEEE Computer Society",
booktitle="12th EUROMICRO Conference on Digital System Design DSD 2009",
chapter="33744",
edition="NEUVEDEN",
howpublished="print",
institution="IEEE Computer Society",
year="2009",
month="may",
pages="823--289",
publisher="IEEE Computer Society",
type="conference paper"
}