This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Architectures for Bit-Split String Scanning in Intrusion Detection
January/February 2006 (vol. 26 no. 1)
pp. 110-117
ASCII Text
x 
 
Lin Tan, Timothy Sherwood, "Architectures for Bit-Split String Scanning in Intrusion Detection," IEEE Micro, vol. 26, no. 1, pp. 110-117, January/February, 2006.
 
 
BibTex
x
 
@article{ 10.1109/MM.2006.5,
author = {Lin Tan and Timothy Sherwood},
title = {Architectures for Bit-Split String Scanning in Intrusion Detection},
journal ={IEEE Micro},
volume = {26},
number = {1},
issn = {0272-1732},
year = {2006},
pages = {110-117},
doi = {http://doi.ieeecomputersociety.org/10.1109/MM.2006.5},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - MGZN
JO - IEEE Micro
TI - Architectures for Bit-Split String Scanning in Intrusion Detection
IS - 1
SN - 0272-1732
SP110
EP117
EPD - 110-117
A1 - Lin Tan,
A1 - Timothy Sherwood,
PY - 2006
KW - Bit-split string
KW - intrusion detection
KW - string matching
VL - 26
JA - IEEE Micro
ER -
 
Lin Tan, University of Illinois, Urbana-Champaign
Timothy Sherwood, University of California, Santa Barbara
String matching is a critical element of modern intrusion detection systems because it lets a system make decisions based not just on headers, but actual content flowing through the network. Through careful codesign and optimization of an architecture with a new string matching algorithm, the authors show it is possible to build a system that is almost 12 times more efficient than the currently best known approaches.
Index Terms:
Bit-split string, intrusion detection, string matching
Citation:
Lin Tan, Timothy Sherwood, "Architectures for Bit-Split String Scanning in Intrusion Detection," IEEE Micro, vol. 26, no. 1, pp. 110-117, Jan.-Feb. 2006, doi:10.1109/MM.2006.5
Usage of this product signifies your acceptance of the Terms of Use.