Compiler for compiling content search rules comprising a...

Details Compiler for compiling content search rules comprising a... Compiler for compiling content search rules comprising a...

2007-12-06

2011-11-08

Vincent, David R (Department: 2129)

Data processing: artificial intelligence

Knowledge processing system

Knowledge representation and reasoning technique

Reexamination Certificate

active

08055601

ABSTRACT:
Memory architecture provides capabilities for high performance content search. Content search rules comprise of regular expressions which are compiled to finite state automata and then programmed in Programmable Intelligent Search Memory (PRISM) for evaluating content with the search rules. A compiler compiles the content search rules for evaluation by PRISM memory. The PRISM memory architecture creates an innovative memory that can be programmed with content search rules which are used by the memory to evaluate presented content for matching with the programmed rules. When the content being searched matches any of the rules programmed in the Programmable Intelligent Search Memory (PRISM) action(s) associated with the matched rule(s) are taken.

REFERENCES:
patent: 6778557 (2004-08-01), Yuki et al.
patent: 6892237 (2005-05-01), Gai et al.
patent: 7353332 (2008-04-01), Miller et al.
patent: 7406470 (2008-07-01), Mathur et al.
patent: 7464254 (2008-12-01), Sharangpani et al.
patent: 7472285 (2008-12-01), Graunke et al.
patent: 7644080 (2010-01-01), Mammen et al.
patent: 7660140 (2010-02-01), Joshi et al.
patent: 7685254 (2010-03-01), Pandya
patent: 7827190 (2010-11-01), Pandya
patent: 7831606 (2010-11-01), Pandya
patent: 7831607 (2010-11-01), Pandya
patent: 7890692 (2011-02-01), Pandya
patent: 7899976 (2011-03-01), Pandya
patent: 7899977 (2011-03-01), Pandya
patent: 7899978 (2011-03-01), Pandya
patent: 7912808 (2011-03-01), Pandya
patent: 2002/0161664 (2002-10-01), Shaya et al.
patent: 2004/0059443 (2004-03-01), Sharangpani
patent: 2004/0083387 (2004-04-01), Dapp et al.
patent: 2004/0215593 (2004-10-01), Sharangpani et al.
patent: 2005/0012521 (2005-01-01), Sharangpani et al.
patent: 2005/0052934 (2005-03-01), Tran et al.
patent: 2005/0108518 (2005-05-01), Pandya
patent: 2005/0216770 (2005-09-01), Rowett et al.
patent: 2006/0085533 (2006-04-01), Hussain et al.
patent: 2006/0136570 (2006-06-01), Pandya
patent: 2006/0253816 (2006-11-01), Gould et al.
patent: 2007/0038798 (2007-02-01), Bouchard et al.
patent: 2007/0061884 (2007-03-01), Dapp et al.
patent: 2007/0255894 (2007-11-01), Hessel et al.
patent: 2008/0008202 (2008-01-01), Terrell et al.
patent: 2008/0046423 (2008-02-01), Khan Alicherry et al.
patent: 2008/0071780 (2008-03-01), Ichiriu et al.
patent: 2008/0133517 (2008-06-01), Kapoor et al.
patent: 2008/0140600 (2008-06-01), Pandya
patent: 2008/0140661 (2008-06-01), Pandya
patent: 2008/0140911 (2008-06-01), Pandya
patent: 2008/0140912 (2008-06-01), Pandya
patent: 2008/0140991 (2008-06-01), Pandya
patent: 2008/0255839 (2008-10-01), Larri et al.
patent: 2009/0100055 (2009-04-01), Wang
patent: 2010/0198850 (2010-08-01), Cytron et al.
Ville Laurikari, “NFAs with Tagged Transitions, Their Conversion to Deterministic Automata and Application to Regular Expressions”, Seventh International Symposium on String Processing Infomratino Retrieval (SPIRE'00), Sep. 27-29, 2000.
Gerard Berry et al., “From Regular Expressions to Deterministic Automata”, Theoretical Computer Science, vol. 48, pp. 117-126 (1986).
Bruce W. Watson, “A Taxonomy of Finite Automata Contruction Algorithms”, Computing Science, May 18, 1994.
Sailesh Kumar et al., “Algorithms to Accelerate Multiple Regular Expression Matching for Deep Packet Inspection”, SIGCOMM'06, Sep. 11-15, 2006, Pisa, Italy, pp. 339-350.
Reetinder Sidhu et al., “Fast Regular Expression Matching Using FPGAs”, Proceedings of the 9th Annual IEEE Symposium of Field-Programmable Custom Computing Machines, pp. 227-238 (2001).
Alfred V. Aho et al., “Efficient String Matching: An Aid to Bibliographic Search”, Communication of the ACM, vol. 18, No. 6, pp. 333-340, Jun. 1975.
James Moscola et al., “Implementation of a Content-Scanning Module for an Internet Firewall”, Proceedings of the 11th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 31, 2003 (9 pages).
Sarang Dhamapurikar et al., “Deep Packet Inspection Using Parallell Bloom Filters”, Hot Interconnects 11, IEEE Computer Society, pp. 52-61, Jan. 2004.
Ken Thompson, “Regular Expression Search Algorithm”, Communication of the ACM, vol. 11, No. 6, pp. 419-422, Jun. 1968.
S.C. Kleene, “Representation of Events in Nerve Nets and Finite Automata”, In Automata Studies, C.E. Shannon and J. McCarthy (eds.), Princeton, University Press, 1956, pp. 3-40.
M. O. Rabin et al., “Finite Automata and Their Decision Problems”, IBM Journal, pp. 114-125, Apr. 1959.
John E. Hopcroft et al., “Introduction to Automata Theory, Language, and Computation”, Addison-Wesley Publishing Company, 1979.
Alfred V. Aho et al., “Compilers: Principles, Techniques, and Tools”, Pearson Education Inc., 2007.
File History of U.S. Appl. No. 11/952,028.
File History of U.S. Appl. No. 11/952,043.
File History of U.S. Appl. No. 11/952,103.
File History of U.S. Appl. No. 11/952,104.
File History of U.S. Appl. No. 11/952,108.
File History of U.S. Appl. No. 11/952,110.
File History of U.S. Appl. No. 11/952,112.
File History of U.S. Appl. No. 11/952,114.
File History of U.S. Appl. No. 11/952,117.
PCT International Search Report and Written Opinion of the International Searching Authority mailed on Apr. 30, 2008 regarding PCT/US2007/86785 filed on Dec. 7, 2007, (13 pgs.).
Office Action issued in U.S. Appl. No. 11/952,028, mailed Sep. 22, 2010.
Notice of Allowance issued in U.S. Appl. No. 11/952,110, mailed Oct. 14, 2010.
Notice of Allowance issued in U.S. Appl. No, 11/952,108, mailed Sep. 24, 2010.
Notice of Allowance issued in U.S. Appl. No. 11/952,117, mailed Oct. 28, 2010.
Notice of Allowance issued in U.S. Appl. No. 11/952,114, mailed Oct. 22, 2010.
Notice of Allowance issued in U.S. Appl. No. 11/952,043, mailed Nov. 22, 2010.
File History of U.S. Appl. No. 12/899,336.
File History of U.S. Appl. No. 12/902,485.
File History of U.S. Appl. No. 121902,500.
File History of U.S. Appl. No. 11/952,028.
File History of U.S. Appl. No. 12/899,336.
File History of U.S. Appl. No. 12/902,485.
File History of U.S. Appl. No. 12/902,500.
File History of U.S. Appl. No. 12/976,881.
File History of U.S. Appl. No. 13/006,265.
File History of U.S. Appl. No. 13/011,681.
File History of U.S. Appl. No. 13/011,692.
File History of U.S. Appl. No. 13/029,782.

Affiliated with

Also associated with

Rating

Compiler for compiling content search rules comprising a... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Compiler for compiling content search rules comprising a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compiler for compiling content search rules comprising a... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4311845