ACM Home Page
Please provide us with feedback. Feedback
Implementing high-speed string matching hardware for network intrusion detection systems
Source
International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 16th international ACM/SIGDA symposium on Field programmable gate arrays table of contents
Monterey, California, USA
POSTER SESSION: Poster session 3: applications and implementations table of contents
Pages 264-264  
Year of Publication: 2008
ISBN:978-1-59593-934-0
Authors
Atul Mahajan  Southern Illinois University, Carbondale, IL
Benfano Soewito  Southern Illinois University, Carbondale, IL
Sai K. Parsi  Southern Illinois University, Carbondale, IL
Ning Weng  Southern Illinois University, Carbondale, IL
Haibo Wang  Southern Illinois University, Carbondale, IL
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1344671.1344726
What is a DOI?

ABSTRACT

This paper presents a string matching hardware on FPGA for network intrusion detection systems. The proposed architecture, consisting of packet classifiers and strings matching verifiers, achieves superb throughput by using several mechanisms. First, based on incoming packet contents, the packet classifiers can dramatically reduce the number of strings to be matched for each packet and, accordingly, feed the packet to a proper verifier to conduct matching. Second, a novel multi-threading finite state machine (FSM) is proposed, which improves FSM clock frequency and allows multiple packets to be examined by a single FSM simultaneously. Design techniques for high-speed interconnect and interface circuits are also presented. Experimental results are presented to explore the trade-offs between system performance, strings partition granularity and hardware resource cost


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
4
5
 
6
 
7
 
8
 
9
S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. Lockwood. Deep packet inspection using parallel bloom filters. IEEE Micro, 24(1):52--61, Jan. 2004.
 
10
S. Dharmapurikar, P. Krishnamurthy, T.S. Sproull, and J.W. Lockwood. Deep packet inspection using parallel Bloom filters. IEEE Micro, 24(1):52--61, Jan. 2004.
11
12
 
13
 
14
Snort, Inc. The Open Source Network Intrusion Detection System, 2004. http://www.snort.org.
15
 
16
Y. Sugawara, M. Inaba, and K. Hiraki. Over 10gbps string matching mechanism for multi-stream packet scanning systems. In Lecture Notes in Computer Science, volume 3203, pages 484--493. Springer-Verlag, 2004.
 
17
N. Tuck, T. Sherwood, B. Calder, and G. Varghese. Deterministic memory--efficient string matching algorithms for intrusion detection. In Proc. of the IEEE Infocom Conference, pages 333--340, 2004.
 
18
 
19
S. Wu and Manber. A fast algorithm for multi-pattern searching. Technical Report TR94-17, Department of Computer Science, University of Arizona, 1994.
 
20
Xilinx, Inc. Virtex-IV Pro and Virtex-IV Pro X Platform FPGAs: Complete Data Sheet, 2004.http://www.xilinx.com.
 
21

Collaborative Colleagues:
Atul Mahajan: colleagues
Benfano Soewito: colleagues
Sai K. Parsi: colleagues
Ning Weng: colleagues
Haibo Wang: colleagues