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

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F09%3APU82695" target="_blank" >RIV/00216305:26230/09:PU82695 - isvavai.cz</a>

Alternative codes found

RIV/63839172:_____/09:00006741

Result on the web

—

DOI - Digital Object Identifier

—

Result language

čeština

Original language name

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

Original language description

As the speed of current computer networks increases,<br>it is necessary to protect networks by security systems<br>such as firewalls and Intrusion Detection Systems operating<br>at multigigabit speeds. Pattern matching is the time-critical<br>operation of current IDS on multigigabit networks. Regular<br>expressions are often used to describe malicious network patterns.<br>This paper deals with fast regular expression matching using<br>the Deterministic Finite Automaton (DFA) with perfect hash<br>function. We introduce decomposition of the problem on two<br>parts: transformation of the input alphabet and usage of a fast<br>DFA, and usage of perfect hashing to reduce space/speed tradeoff<br>for DFA transition table

Czech name

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

Czech description

As the speed of current computer networks increases,<br>it is necessary to protect networks by security systems<br>such as firewalls and Intrusion Detection Systems operating<br>at multigigabit speeds. Pattern matching is the time-critical<br>operation of current IDS on multigigabit networks. Regular<br>expressions are often used to describe malicious network patterns.<br>This paper deals with fast regular expression matching using<br>the Deterministic Finite Automaton (DFA) with perfect hash<br>function. We introduce decomposition of the problem on two<br>parts: transformation of the input alphabet and usage of a fast<br>DFA, and usage of perfect hashing to reduce space/speed tradeoff<br>for DFA transition table

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

12th EUROMICRO Conference on Digital System Design DSD 2009

ISBN

978-0-7695-3782-5

ISSN

—

e-ISSN

—

Number of pages

6

Pages from-to

—

Publisher name

IEEE Computer Society

Place of publication

Patras

Event location

Patras

Event date

Aug 27, 2009

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—