Fast Dynamic Pattern Matching for Deep Packet Inspection
作者： Xu Kefu , Qi Deyu , Qian Zhengping , Zheng Weiping
DOI: 10.1109/ICNSC.2008.4525325
关键词: Pattern matching 、 Deep content inspection 、 Blossom algorithm 、 Pipeline (computing) 、 Network packet 、 Throughput 、 Computer science 、 Wire speed 、 Deep packet inspection 、 Real-time computing
摘要: … a fast dynamic deep packet inspection algorithm using two … In the fast pipeline, multiple parallel Counting Bloom filter … we introduce Bloom Filter and related work that uses Bloom Filter. …
sci-hub.se 参考文章(12)
Ming-Jiang YE, Fast Packet Inspection Using State-Based Bloom Filter Engine Journal of Software. ,vol. 18, pp. 117- ,(2007) , 10.1360/JOS180117
Michael Attig, Sarang Dharmapurikar, John Lockwood, Design and Implementation of a String Matching System for Network Intrusion Detection using FPGA-based Bloom Filters ,(2004) , 10.7936/K7R78CKP
Mike Fisk, George Varghese, Fast Content-Based Packet Handling for Intrusion Detection University of California at San Diego. ,(2001) , 10.21236/ADA406413
Vern Paxson, Bro: a system for detecting network intruders in real-time Computer Networks. ,vol. 31, pp. 2435- 2463 ,(1999) , 10.1016/S1389-1286(99)00112-7
M. Attig, S. Dharmapurikar, J. Lockwood, Implementation results of bloom filters for string matching field-programmable custom computing machines. pp. 322- 323 ,(2004) , 10.1109/FCCM.2004.41
R. Sidhu, V.K. Prasanna, Fast Regular Expression Matching Using FPGAs field-programmable custom computing machines. pp. 227- 238 ,(2001) , 10.1109/FCCM.2001.22
Young H. Cho, William H. Mangione-Smith, A pattern matching coprocessor for network security design automation conference. pp. 234- 239 ,(2005) , 10.1145/1065579.1065641
Mansoor Alicherry, M. Muthuprasanna, Vijay Kumar, High Speed Pattern Matching for Network IDS/IPS international conference on network protocols. pp. 187- 196 ,(2006) , 10.1109/ICNP.2006.320212
C.J. Coit, S. Staniford, J. McAlerney, Towards faster string matching for intrusion detection or exceeding the speed of Snort darpa information survivability conference and exposition. ,vol. 1, pp. 367- 373 ,(2001) , 10.1109/DISCEX.2001.932231
Burton H. Bloom, Space/time trade-offs in hash coding with allowable errors Communications of the ACM. ,vol. 13, pp. 422- 426 ,(1970) , 10.1145/362686.362692