Performance of FPGA implementation of bit-split architecture for intrusion detection systems

Authors:
Hong-Jip Jung;Zachary K. Baker;Viktor K. Prasanna
Affiliations:
University of Southern California, Los Angeles, CA;University of Southern California, Los Angeles, CA;University of Southern California, Los Angeles, CA
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 12
Cited 12

A fast string searching algorithm

Communications of the ACM
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Implementation of a Content-Scanning Module for an Internet Firewall

FCCM '03 Proceedings of the 11th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Inside the Slammer Worm

IEEE Security and Privacy
Time and area efficient pattern matching on FPGAs

FPGA '04 Proceedings of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays
Deep Packet Filter with Dedicated Logic and Read Only Memories

FCCM '04 Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
A Methodology for Synthesis of Efficient Intrusion Detection Systems on FPGAs

FCCM '04 Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Scalable Pattern Matching for High Speed Networks

FCCM '04 Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Gigabit Rate Packet Pattern-Matching Using TCAM

ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Fast Regular Expression Matching Using FPGAs

FCCM '01 Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
A High Throughput String Matching Architecture for Intrusion Detection and Prevention

Proceedings of the 32nd annual international symposium on Computer Architecture
Fast Reconfiguring Deep Packet Filter for 1+ Gigabit Network

FCCM '05 Proceedings of the 13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines

Optimization of pattern matching algorithm for memory based architecture

Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
Exact multi-pattern string matching on the cell/b.e. processor

Proceedings of the 5th conference on Computing frontiers
Scalable multigigabit pattern matching for packet inspection

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Design of high performance pattern matching engine through compact deterministic finite automata

Proceedings of the 45th annual Design Automation Conference
Hierarchical state machine architecture for regular expression pattern matching

Proceedings of the 19th ACM Great Lakes symposium on VLSI
Systolic array for string matching in NIDS

AsiaCSN '07 Proceedings of the Fourth IASTED Asian Conference on Communication Systems and Networks
High performance dictionary-based string matching for deep packet inspection

INFOCOM'10 Proceedings of the 29th conference on Information communications
A memory-efficient pipelined implementation of the aho-corasick string-matching algorithm

ACM Transactions on Architecture and Code Optimization (TACO)
Securing the data path of next-generation router systems

Computer Communications
Efficient pattern matching algorithm for memory architecture

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
String alignment pre-detection using unique subsequences for FPGA-based network intrusion detection

Computer Communications
Revisiting multiple pattern matching algorithms for multi-core architecture

Journal of Computer Science and Technology - Special issue on Community Analysis and Information Recommendation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The use of reconfigurable hardware for network security applications has recently made great strides as Field-Programmable Gate Array (FPGA) devices have provided larger and faster resources. The performance of an Intrusion Detection System is dependent on two metrics: throughput and the total number of patterns that can fit on a device. In this paper, we consider the FPGA implementation details of the bit-split string-matching architecture. The bitsplit algorithm allows large hardware state machines to be converted into a form with much higher memory efficiency. We extend the architecture to satisfy the requirements of the IDS state-of-the-art. We show that the architecture can be effectively optimized for FPGA implementation. We have optimized the pattern memory system parameters and developed new interface hardware for communicating with an external controller. The overall performance (bandwidth * number of patterns) is competitive with other memory-based string matching architectures implemented in FPGA.