公开(公告)号：US20160182215A1

公开(公告)日：2016-06-23

申请号：US14575832

申请日：2014-12-18

Applicant: CISCO TECHNOLOGY, INC.

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

IPC: H04L7/00 ,  H04L12/417

CPC classification number: H04L12/417 ,  H04L43/0852 ,  H04L47/283

Abstract: In one embodiment, a method includes receiving packets in a flow at a network device in a deterministic network, wherein at least one of the packets is transmitted from a source out of sync due to collision with another flow at the source, analyzing at the network device, the flow to reconstruct a period of the flow, and processing at the network device, the packets according to the period to synchronize the processing of the packets at the network device with the source and remove jitter from the flow. An apparatus and logic are also disclosed herein.

Abstract translation: 在一个实施例中，一种方法包括在确定性网络中的网络设备的流中接收分组，其中至少一个分组是由于与来自源的另一流的冲突而从源不同步传送的，在网络分析 设备，流量重建流量的一段时间，并在网络设备处理，根据周期的数据包，同步处理网络设备上的数据包与源，并从流中删除抖动。 本文还公开了一种装置和逻辑。

公开(公告)号：US09363275B2

公开(公告)日：2016-06-07

申请号：US14109590

申请日：2013-12-17

Applicant: CISCO TECHNOLOGY, INC.

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

IPC: G06F17/00 ,  G06N5/02 ,  H04L29/06 ,  G06F9/44

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进行创建，其中采用以正则表达式计算的采样率采样的正则表达式，其中包括从基于最大长度的文本中选择最小采样率，该采样率基于每个正则表达式计算的采样率， 表达。 本文还公开了一种装置和逻辑。

公开(公告)号：US20150358435A1

公开(公告)日：2015-12-10

申请号：US14486556

申请日：2014-09-15

Applicant: CISCO TECHNOLOGY, INC.

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

IPC: H04L29/06 ,  H04L12/939 ,  H04L12/743

CPC classification number: H04L69/22 ,  H04L43/026

Abstract: In one embodiment, a method includes identifying at a network device, a number of items for matching at a hash table, the number of items exceeding matching available with ternary content addressable memory (TCAM) at the network device, defining at the network device, an optimal cyclic redundancy check (CRC) polynomial based on the number of items for matching at the hash table, and generating at the network device, an optimal hash function based on the optimal CRC polynomial to extend packet classification capability at the network device. An apparatus is also disclosed herein.

Abstract translation: 在一个实施例中，一种方法包括在网络设备处识别用于在散列表处进行匹配的项目的数量，在网络设备处定义的与网络设备上的三元内容可寻址存储器（TCAM）可用的项目数量匹配， 基于用于在散列表处进行匹配的项目的数量的最佳循环冗余校验（CRC）多项式，以及在网络设备处生成基于最佳CRC多项式的最优哈希函数，以在网络设备上扩展分组分类能力。 本文还公开了一种装置。