Detail publikace

High Speed Pattern Matching Algorithm Based on Deterministic Finite Automata with Faulty Transition Table

KAŠTIL, J. KOŘENEK, J.

Originální název

High Speed Pattern Matching Algorithm Based on Deterministic Finite Automata with Faulty Transition Table

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Originální abstrakt

Regular expression matching is the time-critical opera- tion of many modern intrusion detection systems (IDS). This paper proposes pattern matching algorithm to match regular expression against multigigabit data stream. As usually used regular expressions are only subjectively tested and often generates many false po- sitives/negatives, proposed algorithm support the pos- sibility to reduce memory requirements by introducing small amount of faults into the pattern matching. Al- gorithm is based on the perfect hashing and is suitable for hardware implementation.

Klíčová slova

Intrusion Detection, Protocol recognition, pattern matching, Perfect hashing

Autoři

KAŠTIL, J.; KOŘENEK, J.

Rok RIV

2010

Vydáno

30. 10. 2010

Nakladatel

Association for Computing Machinery

Místo

La Jolla

ISBN

978-1-4503-0379-8

Kniha

Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems

Strany od

1

Strany do

2

Strany počet

2

URL

https://www.fit.vut.cz/research/publication/9380/

BibTex

@inproceedings{BUT34955,
  author="Jan {Kaštil} and Jan {Kořenek}",
  title="High Speed Pattern Matching Algorithm Based on Deterministic Finite Automata with Faulty Transition Table",
  booktitle="Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems",
  year="2010",
  pages="1--2",
  publisher="Association for Computing Machinery",
  address="La Jolla",
  isbn="978-1-4503-0379-8",
  url="https://www.fit.vut.cz/research/publication/9380/"
}

Dokumenty

05623846.pdf