×

Content search pattern matching using deterministic finite automata (DFA) graphs

  • US 9,652,505 B2
  • Filed: 04/21/2016
  • Issued: 05/16/2017
  • Est. Priority Date: 09/10/2004
  • Status: Active Grant
First Claim
Patent Images

1. A device comprising:

  • at least one network interface;

    at least one processor, the at least one processor matching at least one pattern in an input stream of data by traversing a data structure generated from one or more regular expressions for a content processing application, the input stream received via the at least one network interface; and

    at least one memory operatively coupled to the at least one processor, the at least one memory storing the generated data structure, the generated data structure including at least one node providing information to perform at least one task based on traversing the at least one node, enabling the at least one processor to generate and check state information at the at least one node for the matching to obviate a post-processing overhead of the at least one pattern matched, improving performance of the at least one processor relative to performing post-processing of results for the content processing application.

View all claims
  • 7 Assignments
Timeline View
Assignment View
    ×
    ×