|
Published Articles >> Table of Contents >> Abstract
January/February 2004 (Vol. 24, No. 1)
pp. 52-61
Deep Packet Inspection using Parallel Bloom Filters
Sarang Dharmapurikar, Washington University in St. Louis
Praveen Krishnamurthy, Washington University in St. Louis
Todd S. Sproull, Washington University in St. Louis
John W. Lockwood, Washington University in St. Louis
Full Article Text:
   
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MM.2004.1268997
Send link to a friend
| Abstract |
|
Because conventional software-based packet inspection algorithms have not kept pace with high-speed networks, interest has turned to using hardware to process network data quickly. String scanning with Bloom filters can scan entire packet payloads for predefined signatures at multi-gigabit-per-second line speeds.
|
 References
|
[1] B. Bloom, "Space/Time Trade-Offs in Hash Coding with Allowable Errors," Comm. ACM, vol. 13, no. 7, May 1970, pp. 422-426.
[2] L. Fan, P. Cao, J. Almeida, and A.Z. Broder, “Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol,” IEEE/ACM Trans. Networking, vol. 8, no. 3, pp. 281-293, June 2000.
[3] T.H. Corman et al., Introduction to Algorithms, Prentice Hall, 2002.
[4] M. Ramakrishna, E. Fu, and E. Bahcekapili, "A Performance Study of Hashing Functions for Hardware Applications," Proc. 6th Int'l Conf. Computing and Information, 1994, pp. 1621-1636.
[5] B. Dipert, "Special Purpose SRAMs Smooth the Ride," EDN, June 1999.
[6] J.W. Lockwood et al., "Reprogrammable Network Packet Processing on the Field Programmable Port Extender (FPX)," Proc. ACM Int'l Symp. Field Programmable Gate Arrays (FPGA 01), ACM Press, 2001, pp. 87-93.
[7] J. Coit, S. Staniford, and J. McAlerney, "Towards Faster String Matching for Intrusion Detection or Exceeding the Speed of Snort," Proc. 2nd DARPA Information Survivability Conference and Exposition (DISCEX II), IEEE CS Press, 2001, pp. 367-373.
[8] M. Roesch, "SNORT—Lightweight Intrusion Detection for Networks," Proc. 13th Systems Administration Conf., Usenix Assoc., 1999, pp. 229-238.
[9] M. Fisk and G. Varghese, Fast Content-Based Packet Handling for Intrusion Detection, tech. report CS2001-0670, Univ. of California, San Diego, 2001.
[10] J. Moscola et al., "Implementation of a Content-Scanning Module for an Internet Firewall," Proc. 11th Ann. IEEE Symp. Field-Programmable Custom Computing Machines (FCCM 03), IEEE CS Press, 2003, pp. 31-38.
[11] B.L. Hutchings, R. Franklin, and D. Carver, "Assisting Network Intrusion Detection with Reconfigurable Hardware," Proc. 10th Ann. IEEE Symp. Field-Programmable Custom Computing Machines (FCCM 02), IEEE CS Press, 2002, pp. 111-120.
[12] R. Sidhu and V.K. Prasanna, "Fast Regular Expression Matching using FPGAs," Proc. 9th Ann. IEEE Symp. Field-Programmable Custom Computing Machines (FCCM 01), IEEE CS Press, 2001.
|
 Additional Information
|
Citation:
Sarang Dharmapurikar, Praveen Krishnamurthy, Todd S. Sproull, John W. Lockwood,
"Deep Packet Inspection using Parallel Bloom Filters,"
IEEE Micro,
vol. 24,
no. 1,
pp. 52-61,
Jan/Feb,
2004
|
|
RSS Feed