Fast regular expression matching in hardware using NFA-BDD combination

Authors:
Danai Chasaki;Tilman Wolf
Affiliations:
University of Massachusetts, Amherst, MA;University of Massachusetts, Amherst, MA
Venue:
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Year:
2010

Citing 4
Cited 2

Pre-Decoded CAMs for Efficient and High-Speed NIDS Pattern Matching

FCCM '04 Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Fast Regular Expression Matching Using FPGAs

FCCM '01 Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Constraint Repetition Inspection for Regular Expression on FPGA

HOTI '08 Proceedings of the 2008 16th IEEE Symposium on High Performance Interconnects
Improving NFA-based signature matching using ordered binary decision diagrams

RAID'10 Proceedings of the 13th international conference on Recent advances in intrusion detection

Fast submatch extraction using OBDDs

Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems
Static patterns matching for high speed networks

ICICA'12 Proceedings of the Third international conference on Information Computing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The development of Network Intrusion Detection Systems (NIDS) is nowadays a powerful solution to defend against various network security threats. There has been a lot of research effort devoted to hardware-based NIDS, because of (1) the massive amount of computation performed by regular expression matching algorithms and (2) the gigabit per second performance requirement of modern NIDS. Hardware-based NIDS take advantage of parallelization inherent in FPGAs, ASICs or network processors to support very high network speeds, while software approaches fail to do so.