| 摘要 |
A system, method and computer-readable medium provide for regular expression matching over a plurality of packets. The method embodiment comprises, for each data segment in a flow with no predecessor in a stored list of objects generated from traversing a deterministic finite sate automation (DFA) associated with the regular expression: traversing the DFA using the data segment and a list of all non-accepting states; and if the plurality of packets is not declared as matching, then storing, as list of equivalence classes, automaton state pairs having different starting states but an identical ending state. Finally, the method comprises determining whether the flow matches the regular expression.
|
