Corpus ID: 45700773

OPTIMALIZACE ALGORITMŮ A DATOVÝCH STRUKTUR PRO VYHLEDÁVÁNÍ REGULÁRNÍCH VÝRAZŮ S VYUŽITÍM TECHNOLOGIE FPGA OPTIMIZATION OF ALGORITHMS AND DATA STRUCTURES FOR REGULAR EXPRESSION MATCHING USING FPGA TECHNOLOGY

@inproceedings{Uen2015OPTIMALIZACEAA,
  title={OPTIMALIZACE ALGORITMŮ A DATOVÝCH STRUKTUR PRO VYHLEDÁVÁNÍ REGULÁRNÍCH VÝRAZŮ S VYUŽITÍM TECHNOLOGIE FPGA OPTIMIZATION OF ALGORITHMS AND DATA STRUCTURES FOR REGULAR EXPRESSION MATCHING USING FPGA TECHNOLOGY},
  author={Vysok{\'e} U{\vc}en{\'i} and Technick{\'e} V Brně and Diserta{\vc}n{\'i} Pr{\'a}ce},
  year={2015}
}
This thesis deals with fast regular expression matching using FPGA. Regular expression matching in high speed computer networks is computationally intensive operation used mostly in the field of the computer network security and in the field of monitoring of the network traffic. Current solutions do not achieve throughput required by modern networks with respect to all requirements placed on the matching unit. Innovative hardware architectures implemented in FPGA or ASIC have the highest… Expand

References

SHOWING 1-10 OF 103 REFERENCES
Fast Regular Expression Matching Using FPGAs
TLDR
An efficient method for finding matches to a given regular expression in given text using FPGAs using the Nondetermineistic Finite Automaton, the first prctical use of a nondeterministic state machine on programmable logic. Expand
Hardware accelerated pattern matching based on Deterministic Finite Automata with perfect hashing
  • Jan Kastil, J. Korenek
  • Computer Science
  • 13th IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems
  • 2010
TLDR
This paper deals with the analysis of regular expressions used by modern IDS to describe malicious traffic and proposes architecture for fast pattern matching using perfect hashing suitable for implementation into FPGA platform. Expand
Pattern-Unit Based Regular Expression Matching with Reconfigurable Function Unit
TLDR
A novel approach to accelerate RE pattern matching based on Pattern-Unit (PUREM) is proposed here, in which Pattern- Unit matching is accomplished by a Reconfigurable Function Unit (RFU). Expand
NFA reduction for regular expressions matching using FPGA
TLDR
This paper investigates applicability of NFA reduction techniques - a formal aparatus to reduce the number of states and transitions in NFA prior to its mapping into FPGA, each with a different reduction power and time complexity. Expand
Regular Expression Matching in Reconfigurable Hardware
TLDR
A regular expression pattern matching approach for reconfigurable hardware that is 10–20× more efficient than previous Field Programmable Gate Array approaches, and the generated designs have comparable area requirements to current application-specific integrated circuit solutions. Expand
Optimization of Pattern Matching Circuits for Regular Expression on FPGA
TLDR
A novel sharing architecture allowing the algorithm to extract and share common subregular expressions is presented, which significantly reduces the area of pattern matching circuits for regular expression. Expand
An improved algorithm to accelerate regular expression evaluation
TLDR
This paper introduces a general compression technique that results in at most 2N state traversals when processing a string of length N, and describes a novel alphabet reduction scheme for DFA-based structures that can yield further dramatic reductions in data structure size. Expand
Reorganized and Compact DFA for Efficient Regular Expression Matching
TLDR
A DFA-based algorithm named RCDFA (Reorganized and Compact DFA), which dramatically reduces the memory usage while maintaining fast and deterministic lookup speed, and which consistently achieves over 95% compression ratio for existing real-life rule sets. Expand
A modular NFA architecture for regular expression matching
TLDR
A CCR-syntax tree and its parsing scheme to map a Perl or POSIX regexp rule to a CES topology, which is designed to realize a new MIN-MAX counting algorithm, which can solve both the character class ambiguity problem and the overlapped matching problem. Expand
Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing
TLDR
This paper deals with fast regular expression matching using the Deterministic Finite Automaton (DFA) with perfect hash function, and introduces decomposition of the problem on two parts: transformation of the input alphabet and usage of a fast DFA, and use of perfect hashing to reduce space/speed tradeoff for DFA transition table. Expand
...
1
2
3
4
5
...