loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Using String Matching for Deep Packet Inspection
April 2008 (vol. 41 no. 4)
pp. 23-28
ASCII Text
x 
 
Po-Ching Lin, Ying-Dar Lin, Yuan-Cheng Lai, Tsern-Huei Lee, "Using String Matching for Deep Packet Inspection," Computer, vol. 41, no. 4, pp. 23-28, April, 2008.
 
 
BibTex
x
 
@article{ 10.1109/MC.2008.138,
author = {Po-Ching Lin and Ying-Dar Lin and Yuan-Cheng Lai and Tsern-Huei Lee},
title = {Using String Matching for Deep Packet Inspection},
journal ={Computer},
volume = {41},
number = {4},
issn = {0018-9162},
year = {2008},
pages = {23-28},
doi = {http://doi.ieeecomputersociety.org/10.1109/MC.2008.138},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - MGZN
JO - Computer
TI - Using String Matching for Deep Packet Inspection
IS - 4
SN - 0018-9162
SP23
EP28
EPD - 23-28
A1 - Po-Ching Lin,
A1 - Ying-Dar Lin,
A1 - Yuan-Cheng Lai,
A1 - Tsern-Huei Lee,
PY - 2008
KW - pattern matching
KW - algorithms
KW - system performance
VL - 41
JA - Computer
ER -
 
Po-Ching Lin, National Chiao Tung University
Ying-Dar Lin, National Chiao Tung University
Yuan-Cheng Lai, National Taiwan University of Science and Technology
Tsern-Huei Lee, National Chiao Tung University
String matching has sparked renewed research interest due to its usefulness for deep packet inspection in applications such as intrusion detection, virus scanning, and Internet content filtering. Matching expressive pattern specifications with a scalable and efficient design, accelerating the entire packet flow, and string matching with high-level semantics are promising topics for further study.

1. P. Gupta and N. McKeown, "Algorithms for Packet Classification," IEEE Network, vol. 15, no. 2, Mar./Apr. 2001, pp. 529–551.
2. F. Yu et al., "Fast and Memory-Efficient Regular Expression Matching for Deep Packet Inspection," Proc. Symp. Architectures Networking and Comm. Systems (ANCS 06), ACM Press, 2006, pp. 93–102.
3. G. Navarro and M. Raffinot, "New Techniques for Regular Expression Searching," Algorithmica, Springer-Verlag, vol. 41, no. 2, 2004, pp. 89–116.
4. Z. Galil, "On Improving the Worst-Case Running Time of the Boyer-Moore String Searching Algorithm," Comm. ACM, vol. 22, no. 9, 1979, pp. 505–508.
5. J. Bispo et al., "Regular Expression Matching for Reconfigurable Packet Inspection," Proc. IEEE Int'l Conf. Field-Programmable Technology (FPT 06), IEEE Press, 2006, pp. 119–126.
6. V. Paxson et al., "Rethinking Hardware Support for Network Analysis and Intrusion Prevention," Proc. Usenix Workshop Hot Topics in Security, Usenix, 2006, pp. 63–68; http://imawhiner.com/csl/usenix/06hotsec/ techpaxson.html.
7. R. Sommer and V. Paxson, "Enhancing Byte-Level Network Intrusion Detection Signatures with Context," Proc. ACM Computer and Comm. Security (CCS 03), ACM Press, 2003, pp. 262–271.
8. T.J. Green et al., "Processing XML Streams with Deterministic Automata and Stream Indexes," ACM Trans. Database Systems, Dec. 2004, pp. 752–788.
1. J. Friedl, Mastering Regular Expressions, 3rd ed., O'Reilly, 2006.

Index Terms:
pattern matching, algorithms, system performance
Citation:
Po-Ching Lin, Ying-Dar Lin, Yuan-Cheng Lai, Tsern-Huei Lee, "Using String Matching for Deep Packet Inspection," Computer, vol. 41, no. 4, pp. 23-28, Apr. 2008, doi:10.1109/MC.2008.138
Usage of this product signifies your acceptance of the Terms of Use.