Signature search architecture for programmable intelligent search memory
First Claim
1. An integrated circuit chip comprising programmable intelligent search memory for content search wherein said programmable intelligent search memory performs regular expression based search and signature pattern based search, said programmable intelligent search memory using a plurality of regular expressions and a plurality of signature patterns, and said programmable intelligent search memory comprising a plurality of programmable FSA rule search engines to perform search using a plurality of regular expressions and further comprising one or more programmable signature search engines to perform content search using a plurality of signature patterns, said plurality of regular expressions comprising a plurality of symbols or characters, said plurality of regular expressions converted into a plurality of finite state automata representing the functionality of the said plurality of regular expressions for programming in the said programmable FSA rule search engines, said plurality of finite state automata comprising a plurality of states, said plurality of states derived from the said plurality of symbols or characters of said plurality of regular expressions, said content comprising a plurality of input symbols or characters provided as input to the said programmable intelligent search memory, said plurality of programmable FSA rule search engines comprising at least one of each of:
- a. a symbol memory circuit to store said plurality of symbols;
b. a symbol evaluation circuit coupled to the said symbol memory circuit to evaluate match of the said plurality of symbols stored in the said symbol memory circuit with said plurality of input symbols of said content;
c. a state dependent vector (SDV) memory circuit to store state transition controls for said plurality of finite state automata;
d. a current state vector (CSV) memory circuit to store said plurality of states; and
e. a state transition circuit coupled to the said symbol evaluation circuit, current state vector memory circuit and said state dependent vector memory circuit to perform state transition from one or more first states to one or more second states of said plurality of states of said plurality of finite state automata.
1 Assignment
0 Petitions
Accused Products
Abstract
Memory architecture provides capabilities for high performance content search. The architecture creates an innovative memory that can be programmed with content search rules which are used by the memory to evaluate presented content for matching with the programmed rules. Content search rules include of regular expressions which are compiled to finite state automata (FSA) and further include of patterns of strings a first set of which are compiled to a compressed signature database and a second set of which are compiled into FSAs. The finite state automata are then programmed in Programmable Intelligent Search Memory (PRISM) programmable FSA rule blocks and the compressed signature database is programmed in the PRISM signature search engines for evaluating content with the content search rules. A compiler compiles the content search rules for evaluation by PRISM memory. When the content being searched matches any of the rules programmed in the Programmable Intelligent Search Memory (PRISM), action(s) associated with the matched rule(s) are taken.
102 Citations
18 Claims
-
1. An integrated circuit chip comprising programmable intelligent search memory for content search wherein said programmable intelligent search memory performs regular expression based search and signature pattern based search, said programmable intelligent search memory using a plurality of regular expressions and a plurality of signature patterns, and said programmable intelligent search memory comprising a plurality of programmable FSA rule search engines to perform search using a plurality of regular expressions and further comprising one or more programmable signature search engines to perform content search using a plurality of signature patterns, said plurality of regular expressions comprising a plurality of symbols or characters, said plurality of regular expressions converted into a plurality of finite state automata representing the functionality of the said plurality of regular expressions for programming in the said programmable FSA rule search engines, said plurality of finite state automata comprising a plurality of states, said plurality of states derived from the said plurality of symbols or characters of said plurality of regular expressions, said content comprising a plurality of input symbols or characters provided as input to the said programmable intelligent search memory, said plurality of programmable FSA rule search engines comprising at least one of each of:
-
a. a symbol memory circuit to store said plurality of symbols; b. a symbol evaluation circuit coupled to the said symbol memory circuit to evaluate match of the said plurality of symbols stored in the said symbol memory circuit with said plurality of input symbols of said content; c. a state dependent vector (SDV) memory circuit to store state transition controls for said plurality of finite state automata; d. a current state vector (CSV) memory circuit to store said plurality of states; and e. a state transition circuit coupled to the said symbol evaluation circuit, current state vector memory circuit and said state dependent vector memory circuit to perform state transition from one or more first states to one or more second states of said plurality of states of said plurality of finite state automata. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)
-
Specification