公开(公告)号：US20150172159A1

公开(公告)日：2015-06-18

申请号：US14109590

申请日：2013-12-17

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Domenico Ficara ,  Salvatore Valenza ,  Roberto Muccifora ,  Leo Caldarola

IPC: H04L12/26 ,  G06N5/00 ,  H04L29/06

CPC classification number: H04L63/1408 ,  G06F9/4498

Abstract: 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.

Abstract translation: 在一个实施例中，一种方法包括在网络设备处接收的分组中对文本进行采样，并使用采样的确定性有限自动机（DFA）分析采样的文本，以识别一组正则表达式和文本之间的匹配。 采用采样的DFA进行创建，其中采用以正则表达式计算的采样率采样的正则表达式，其中包括从基于最大长度的文本中选择最小采样率，该采样率基于每个正则表达式计算的采样率， 表达。 本文还公开了一种装置和逻辑。