发明名称 METHOD AND APPARATUS FOR PROCESSING OF FINITE AUTOMATA
摘要 A method, and corresponding apparatus and system are provided for optimizing matching at least one regular expression pattern in an input stream by walking at least one finite automaton in a speculative manner. The speculative manner may include walking at least two nodes of a given finite automaton, of the at least one finite automaton, in parallel, with a segment, at a given offset within a payload of a packet in the input stream. The walking may include determining a match result for the segment, at the given offset within the payload, at each node of the at least two nodes. The walking may further include determining at least one subsequent action for walking the given finite automaton, based on an aggregation of each match result determined.
申请公布号 US2015186786(A1) 申请公布日期 2015.07.02
申请号 US201314143586 申请日期 2013.12.30
申请人 Cavium, Inc. 发明人 Goyal Rajan;Billa Satyanarayana Lakshmipathi;Dikshit Abhishek
分类号 G06N5/04 主分类号 G06N5/04
代理机构 代理人
主权项 1. A security appliance operatively coupled to a network, the security appliance comprising: at least one memory configured to store at least one finite automaton including a plurality of nodes generated from at least one regular expression pattern; at least one processor operatively coupled to the at least one memory and configured to walk the at least one finite automaton, with segments of an input stream received via the network, to match the at least one regular expression pattern in the input stream, the walk including: walking at least two nodes of a given finite automaton, of the at least one finite automaton, in parallel, with a segment, at a given offset within a payload, of a packet in the input stream;determining a match result for the segment, at the given offset within the payload, at each node of the at least two nodes; anddetermining at least one subsequent action for walking the given finite automaton, based on an aggregation of each match result determined.
地址 San Jose CA US