Method and apparatus for constructing a failure tree from a...

Details Method and apparatus for constructing a failure tree from a... Method and apparatus for constructing a failure tree from a...

2007-07-30

2009-10-27

Lewis, Cheryl (Department: 2167)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000

Reexamination Certificate

active

07610269

ABSTRACT:
A method for representing a search tree embodying a plurality of signatures to be searched for in an input string of characters constructs a failure tree in which the states are re-organized in levels according to the number of failure transitions between each state and the root node of the search tree.

REFERENCES:
patent: 5299206 (1994-03-01), Beaverson et al.
patent: 6856981 (2005-02-01), Wyschogrod et al.
patent: 7440304 (2008-10-01), Raj
patent: 2003/0051043 (2003-03-01), Wyschogrod et al.
patent: 2003/0065800 (2003-04-01), Wyschogrod et al.
patent: 2005/0114306 (2005-05-01), Shu et al.
patent: 2007/0192286 (2007-08-01), Norton et al.
“Efficient String Matching: An Aid to Bibliograpic Search,” Alfred V. Aho, Margaret J. Corasick; Bell Laboratories; Jun. 1975; pp. 333 thru 340.
“High Speed Pattern Matching for Network IDS/IPS”, Mansoor Alicherry, M. Muthuprasanna, Vijay Kumar; IEEE Report Sep. 2006; pp. 187 thru 196.

Affiliated with

Also associated with

Rating

Method and apparatus for constructing a failure tree from 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 Method and apparatus for constructing a failure tree from a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for constructing a failure tree from a... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4108254