1
Ron K Cytron, David Edward Taylor, Benjamin Curry Brodie: Method and device for high performance regular expression pattern matching. Exegy Incorporated, Thompson Coburn, Benjamin L Volk Jr Esq, April 20, 2010: US07702629 (111 worldwide citation)

Disclosed herein is an improved architecture for regular expression pattern matching. Improvements to pattern matching deterministic finite automatons (DFAs) that are described by the inventors include a pipelining strategy that pushes state-dependent feedback to a final pipeline stage to thereby en ...


2
David Edward Taylor: Method and apparatus for approximate pattern matching. Exegy Incorporated, Thompson Coburn, December 22, 2009: US07636703 (107 worldwide citation)

A system and method for inspecting a data stream for data segments matching one or more patterns each having a predetermined allowable error, which includes filtering a data stream for a plurality of patterns of symbol combinations with a plurality of parallel filter mechanisms, detecting a pluralit ...


3
Ron K Cytron, David Edward Taylor, Benjamin Curry Brodie: Method and device for high performance regular expression pattern matching. Exegy Incorporated, Thompson Coburn, May 17, 2011: US07945528 (48 worldwide citation)

Disclosed herein is an improved architecture for regular expression pattern matching. Improvements to pattern matching deterministic finite automatons (DFAs) that are described by the inventors include a pipelining strategy that pushes state-dependent feedback to a final pipeline stage to thereby en ...


4
Sarang Dharmapurikar, Praveen Krishnamurthy, David Edward Taylor: Method and system for performing longest prefix matching for network address lookup using bloom filters. Washington University, Edward J Radlo, Glenn Patent Group, October 13, 2009: US07602785 (23 worldwide citation)

The present invention relates to a method and system of performing parallel membership queries to Bloom filters for Longest Prefix Matching, where address prefix memberships are determined in sets of prefixes sorted by prefix length. Hash tables corresponding to each prefix length are probed from th ...


5
Ron K Cytron, David Edward Taylor, Benjamin Curry Brodie: Method and device for high performance regular expression pattern matching. Thompson Coburn, June 7, 2007: US20070130140-A1

Disclosed herein is an improved architecture for regular expression pattern matching. Improvements to pattern matching deterministic finite automatons (DFAs) that are described by the inventors include a pipelining strategy that pushes state-dependent feedback to a final pipeline stage to thereby en ...


6
David Edward Taylor: Method and Apparatus for Approximate Pattern Matching. Exegy Incorporated, Thompson Coburn, November 8, 2007: US20070260602-A1

A system and method for inspecting a data stream for data segments matching one or more patterns each having a predetermined allowable error, which includes filtering a data stream for a plurality of patterns of symbol combinations with a plurality of parallel filter mechanisms, detecting a pluralit ...


7
Sarang Dharmapurikar, Praveen Krishnamurthy, David Edward Taylor: Method and system for performing longest prefix matching for network address lookup using bloom filters. Washington University, Sonnenschein Nath & Rosenthal, September 8, 2005: US20050195832-A1

The present invention relates to a method and system of performing parallel membership queries to Bloom filters for Longest Prefix Matching, where address prefix memberships are determined in sets of prefixes sorted by prefix length. Hash tables corresponding to each prefix length are probed from th ...


8
Ron K Cytron, David Edward Taylor, Benjamin Curry Brodie: Method and Device for High Performance Regular Expression Pattern Matching. Exegy Incorporated, Thompson Coburn, August 5, 2010: US20100198850-A1

Disclosed herein is an improved architecture for regular expression pattern matching. Improvements to pattern matching deterministic finite automatons (DFAs) that are described by the inventors include a pipelining strategy that pushes state-dependent feedback to a final pipeline stage to thereby en ...


9
Sarang Dharmapurikar, Praveen Krishnamurthy, David Edward Taylor: Longest prefix matching for network address lookups using bloom filters. Radlo & Su, April 22, 2010: US20100098081-A1

Methods and systems for performing parallel membership queries to Bloom filters for Longest Prefix Matching, where address prefix memberships are determined in sets of prefixes sorted by prefix length. Hash tables corresponding to each prefix length are probed from the longest to the shortest match ...



Click the thumbnails below to visualize the patent trend.