Patent · US Active

Parallelized pattern matching using non-deterministic finite automata

US9021582B2 · kind B2 · utility

3Cited by

3References

38Claims

0Family size

Assignee

Juniper Networks, Inc. · US

Inventors

Gary S. Goldman · Los Altos, US
Philip A. Thomas · San Jose, US
Ramesh Panwar · Pleasanton, US

Key dates

Filing date	Apr 24, 2007
Grant date	Apr 28, 2015
Priority date	—
Expiry date	Jan 20, 2034

Classification

Technology area (CPC H)Electricity
CPC primaryH04L63/1416
WIPO fieldDigital communication
WIPO sectorElectrical engineering

Abstract

This disclosure describes techniques of determining whether a symbol stream includes a pattern defined by a regular expression. As described herein, the regular expression may be represented using a non-deterministic finite automaton (NFA). A plurality of states in the NFA may be evaluated in parallel. These states may be associated with a plurality of symbol positions in a symbol stream. Evaluating a plurality of states and symbols in parallel may allow for faster determinations of whether the symbol stream includes the pattern defined by the regular expression.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.