Deterministic finite automata (DFA) instruction
US8301788B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 7, 2005 |
| Grant date | Oct 30, 2012 |
| Priority date | — |
| Expiry date | Apr 13, 2029 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L1/0045
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A computer-readable instruction is described for traversing deterministic finite automata (DFA) graphs to perform a pattern search in the in-coming packet data in real-time. The instruction includes one or more pre-defined fields. One of the fields includes a DFA graph identifier for identifying one of several previously-stored DFA graphs. Another one of the fields includes an input reference for identifying input data to be processed using the identified DFA graphs. Yet another one of the fields includes an output reference for storing results generated responsive to the processed input data. The instructions are forwarded to a DFA engine adapted to process the input data using the identified DFA graph and to provide results as instructed by the output reference.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.