Method and apparatus for detecting predefined signatures in...

Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Particular communication authentication technique

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C713S161000, C713S168000, C713S180000, C713S182000, C726S003000, C726S027000, C380S255000

Reexamination Certificate

active

07444515

ABSTRACT:
The present invention relates to a method and apparatus based on Bloom filters for detecting predefined signatures (a string of bytes) in a network packet payload. A Bloom filter is a data structure for representing a set of strings in order to support membership queries. Hardware Bloom filters isolate all packets that potentially contain predefined signatures. Another independent process eliminates false positives produced by the Bloom filters. The system is implemented on a FPGA platform, resulting in a set of 10,000 strings being scanned in the network data at the line speed of 2.4 Gbps.

REFERENCES:
patent: 5701464 (1997-12-01), Aucsmith
patent: 5813000 (1998-09-01), Furlani
patent: 5991881 (1999-11-01), Conklin et al.
patent: 6067569 (2000-05-01), Khaki et al.
patent: 6073160 (2000-06-01), Grantham et al.
patent: 6134551 (2000-10-01), Aucsmith
patent: 6147976 (2000-11-01), Shand et al.
patent: 6169969 (2001-01-01), Cohen
patent: 6279113 (2001-08-01), Vaidya
patent: 6377942 (2002-04-01), Hinsley et al.
patent: 6499107 (2002-12-01), Gleichauf et al.
patent: 6804667 (2004-10-01), Martin
patent: 6978223 (2005-12-01), Milliken
patent: 7167980 (2007-01-01), Chiu
patent: 2002/0129140 (2002-09-01), Peled et al.
patent: 2002/0162025 (2002-10-01), Sutton et al.
patent: 2002/0166063 (2002-11-01), Lachman, III et al.
patent: 2003/0009693 (2003-01-01), Brock et al.
patent: 2003/0014662 (2003-01-01), Gupta et al.
patent: 2003/0023876 (2003-01-01), Bardsley et al.
patent: 2003/0065943 (2003-04-01), Geis et al.
patent: 2003/0074582 (2003-04-01), Patel et al.
patent: 2003/0110229 (2003-06-01), Kulig et al.
Artan et al, Multi-packet Signature Detection using Prefix Bloom Filters, 2005, IEEE, pp. 1811-1816.
Yan et al, Enhancing Collaborative Spam Detection with Bloom Filters, 2006, IEEE, pp. 414-425.
Donnet et al, Retouched Bloom Filters: Allowing Networked Applications to Trade Off Selected False Positives Against False Negatives, 2006, ACM, pp. 1-12.
Bonomi et al, Beyond Bloom Filters: From Approximate Membership Checks to Approximate State Machines, 2006, ACM, pp. 315-326.
Hao et al, Building High Accuracy Bloom Filters using Partitioned Hashing, 2007, ACM, pp. 277-287.
Kaya et al, Increasing the power efficiency of Bloom filters for network string matching, 2006, IEEE, pp. 1828-1831□□.
Artan et al, Multi-packet signature detection using prefix bloom filters, 2005, IEEE, pp. 1811-1816.
Kefu et al, Fast Dynamic Pattern Matching for Deep Packet Inspection, 2008, IEEE pp. 802-807.
Burton H. Bloom, “Space/Time Trade-offs in Hash Coding With Allowable Errors”, Communications of the ACM, Jul. 1970, pp. 422-426, vol. 13, No. 7, Computer Usage Company, Newton Upper Falls, Massachusetts, USA.
Dharmapurikar et al., “Deep Packet Inspection Using Parallel Bloom Filters,” Symposium on High Performance Interconnnects (HotI), Stanford, California, 2003, pp. 44-51.
Dharmapurikar et al., “Longest Prefix Matching Using Bloom Filters,” SIGCOMM, 2003, pp. 201-212.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for detecting predefined signatures in... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for detecting predefined signatures in..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for detecting predefined signatures in... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4016223

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.