发明名称 |
Sampled deterministic finite automata for deep packet inspection |
摘要 |
In one embodiment, a method includes sampling text in a received packet at a network device and analyzing the sampled text using a sampled deterministic finite automata (DFA) to identify matches between a set of regular expressions and the text. The sampled DFA is created with the regular expressions sampled at a sampling rate calculated for the regular expressions using operations including selecting a minimum sampling rate from sampling rates computed for each of the regular expressions based on a minimum length of the text that can match the regular expression. An apparatus and logic are also disclosed herein. |
申请公布号 |
US9363275(B2) |
申请公布日期 |
2016.06.07 |
申请号 |
US201314109590 |
申请日期 |
2013.12.17 |
申请人 |
Cisco Technology, Inc. |
发明人 |
Ficara Domenico;Valenza Salvatore;Muccifora Roberto;Caldarola Leo |
分类号 |
G06F17/00;G06N5/02;H04L29/06;G06F9/44 |
主分类号 |
G06F17/00 |
代理机构 |
|
代理人 |
Kaplan Cindy |
主权项 |
1. A method comprising:
sampling text in a received packet at a network device; and analyzing the sampled text using a sampled deterministic finite automata (DFA) to identify matches between a set of regular expressions and the text, the sampled DFA created with said regular expressions sampled at a sampling rate, the sampling rate calculated for said regular expressions using operations comprising selecting a minimum sampling rate from sampling rates computed for each of said regular expressions based on a minimum length of the text that can match said regular expression; wherein the minimum length comprises a sum of lengths of substrings in said regular expression. |
地址 |
San Jose CA US |