High Speed Pattern Matching Algorithm Based on Deterministic Finite Automata with Faulty Transition Table
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F10%3APU89653" target="_blank" >RIV/00216305:26230/10:PU89653 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
High Speed Pattern Matching Algorithm Based on Deterministic Finite Automata with Faulty Transition Table
Original language description
Regular expression matching is the time-critical opera-<br>tion of many modern intrusion detection systems (IDS).<br>This paper proposes pattern matching algorithm to<br>match regular expression against multigigabit data<br>stream. As usually used regular expressions are only<br>subjectively tested and often generates many false po-<br>sitives/negatives, proposed algorithm support the pos-<br>sibility to reduce memory requirements by introducing<br>small amount of faults into the pattern matching. Al-<br>gorithm is based on the perfect hashing and is suitable<br>for hardware implementation.<br><br>
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
ISBN
978-1-4503-0379-8
ISSN
—
e-ISSN
—
Number of pages
2
Pages from-to
—
Publisher name
Association for Computing Machinery
Place of publication
La Jolla
Event location
Princeton
Event date
Oct 19, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—