Detail publikace

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

Originální název

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

Anglický název

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

Jazyk

en

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.

Anglický 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.

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",
  annote="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.",
  address="Association for Computing Machinery",
  booktitle="Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems",
  chapter="34955",
  edition="NEUVEDEN",
  howpublished="print",
  institution="Association for Computing Machinery",
  year="2010",
  month="october",
  pages="1--2",
  publisher="Association for Computing Machinery",
  type="conference paper"
}