公开(公告)号：US08918588B2

公开(公告)日：2014-12-23

申请号：US12419523

申请日：2009-04-07

申请人： Brian Bass ,  Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

发明人： Brian Bass ,  Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

IPC分类号： G06F12/02 ,  G06F12/12

CPC分类号： G06F12/121 ,  G06F12/123

摘要： Techniques for replacing one or more blocks in a cache, the one or more blocks being associated with a plurality of data streams, are provided. The one or more blocks in the cache are grouped into one or more groups, each corresponding to one of the plurality of data streams. One or more incoming blocks are received. To free space, the one or more blocks of the one or more groups in the cache are invalidated in accordance with at least one of an inactivity of a given data stream corresponding to the one or more groups and a length of the one or more groups. The one or more incoming blocks are stored in the cache. A number of data streams maintained within the cache is maximized.

摘要翻译： 提供了用于替换高速缓存中的一个或多个块的技术，所述一个或多个块与多个数据流相关联。 高速缓存中的一个或多个块被分组成一个或多个组，每个组对应于多个数据流中的一个。 接收一个或多个传入块。 为了释放空间，根据与一个或多个组对应的给定数据流的不活动和一个或多个组的长度中的至少一个，高速缓存中的一个或多个组中的一个或多个组的一个或多个块无效 。 一个或多个传入块被存储在高速缓存中。 保持在高速缓存内的多个数据流被最大化。

公开(公告)号：US20100257320A1

公开(公告)日：2010-10-07

申请号：US12419523

申请日：2009-04-07

申请人： Brian Bass ,  Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

发明人： Brian Bass ,  Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

IPC分类号： G06F12/12 ,  G06F12/08

CPC分类号： G06F12/121 ,  G06F12/123

摘要： Techniques for replacing one or more blocks in a cache, the one or more blocks being associated with a plurality of data streams, are provided. The one or more blocks in the cache are grouped into one or more groups. Each group corresponding to one of the plurality of data streams. One or more incoming blocks are received. To free space, the one or more blocks of the one or more groups in the cache are invalidated in accordance with at least one of an inactivity of a given data stream corresponding to the one or more groups and a length of the one or more groups. The one or more incoming blocks are stored in the cache. A number of data streams maintained within the cache is maximized.

摘要翻译： 提供了用于替换高速缓存中的一个或多个块的技术，所述一个或多个块与多个数据流相关联。 缓存中的一个或多个块被分组成一个或多个组。 每个组对应于多个数据流之一。 接收一个或多个传入块。 为了释放空间，根据与一个或多个组对应的给定数据流的不活动和一个或多个组的长度中的至少一个，高速缓存中的一个或多个组中的一个或多个组的一个或多个块无效 。 一个或多个传入块被存储在高速缓存中。 保持在高速缓存内的多个数据流被最大化。

公开(公告)号：US20100253556A1

公开(公告)日：2010-10-07

申请号：US12418896

申请日：2009-04-06

申请人： Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

发明人： Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

IPC分类号： H03M7/40

CPC分类号： H03M7/40

摘要： A novel and useful method of constructing a fast approximation of a dynamic Huffman table from a data sample comprising a subset of data to be compressed. The frequency of incidence of each symbol in the sample is calculated, and the symbols are then allocated to predefined bins based on their frequency of incidence. The bins are then transformed into binary sub-trees, where the leaf nodes of the binary sub-trees comprise the symbols of the bin associated with the binary sub-trees. The binary sub-trees are then combined via nesting, thereby creating a coarse grained binary tree, where all leaves are mapped to a specified number of depths. The coarse grained binary tree is then traversed, thereby yielding a canonical code for each symbol, thereby defining the entries for a dynamic Huffman table.

摘要翻译： 一种从包括要压缩的数据的子集的数据样本构建动态霍夫曼表的快速近似的新颖且有用的方法。 计算样本中每个符号的入射频率，然后根据其入射频率将符号分配给预定义的分组。 然后，将这些分组转换成二进制子树，其中二进制子树的叶节点包括与二进制子树相关联的bin的符号。 然后通过嵌套组合二进制子树，从而创建粗粒度二叉树，其中所有叶被映射到指定数量的深度。 然后遍历粗粒二进制树，从而为每个符号产生规范代码，从而为动态霍夫曼表定义条目。

公开(公告)号：US07692561B2

公开(公告)日：2010-04-06

申请号：US12175214

申请日：2008-07-17

申请人： Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

发明人： Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

IPC分类号： H03M7/34

CPC分类号： H03M7/3086

摘要： A method for decompressing a stream of a compressed data packet includes determining whether first data of a data-dictionary for a first decompression copy operation is located in a history buffer on a remote memory or a local memory, and when it is determined that the first data is located in the remote memory, stalling the first decompression copy operation, performing a second decompression operation using second data that is located in the history buffer on the local memory and fetching the first data from the remote memory to the history buffer on the local memory. The method further includes performing the first decompression operation using the first data in the history buffer on the local memory.

摘要翻译： 用于对压缩数据分组的流进行解压缩的方法包括：确定用于第一解压缩复制操作的数据字典的第一数据是否位于远程存储器或本地存储器上的历史缓冲器中，以及当确定第一 数据位于远程存储器中，停止第一次解压缩复制操作，使用位于本地存储器上的历史缓冲器中的第二数据执行第二次解压缩操作，并将第一数据从远程存储器读取到本地的历史缓冲区 记忆。 该方法还包括使用本地存储器上的历史缓冲器中的第一数据来执行第一解压缩操作。

公开(公告)号：US20100013678A1

公开(公告)日：2010-01-21

申请号：US12175214

申请日：2008-07-17

申请人： Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

发明人： Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

IPC分类号： H03M5/00

CPC分类号： H03M7/3086

摘要： A method for decompressing a stream of a compressed data packet includes determining whether first data of a data-dictionary for a first decompression copy operation is located in a history buffer on a remote memory or a local memory, and when it is determined that the first data is located in the remote memory, stalling the first decompression copy operation, performing a second decompression operation using second data that is located in the history buffer on the local memory and fetching the first data from the remote memory to the history buffer on the local memory. The method further includes performing the first decompression operation using the first data in the history buffer on the local memory.

摘要翻译： 用于对压缩数据分组的流进行解压缩的方法包括：确定用于第一解压缩复制操作的数据字典的第一数据是否位于远程存储器或本地存储器上的历史缓冲器中，以及当确定第一 数据位于远程存储器中，停止第一次解压缩复制操作，使用位于本地存储器上的历史缓冲器中的第二数据执行第二次解压缩操作，并将第一数据从远程存储器读取到本地的历史缓冲区 记忆。 该方法还包括使用本地存储器上的历史缓冲器中的第一数据来执行第一解压缩操作。

公开(公告)号：US07834781B2

公开(公告)日：2010-11-16

申请号：US12418896

申请日：2009-04-06

申请人： Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

发明人： Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

IPC分类号： H03M7/40

CPC分类号： H03M7/40

摘要： A novel and useful method of constructing a fast approximation of a dynamic Huffman table from a data sample comprising a subset of data to be compressed. The frequency of incidence of each symbol in the sample is calculated, and the symbols are then allocated to predefined bins based on their frequency of incidence. The bins are then transformed into binary sub-trees, where the leaf nodes of the binary sub-trees comprise the symbols of the bin associated with the binary sub-trees. The binary sub-trees are then combined via nesting, thereby creating a coarse grained binary tree, where all leaves are mapped to a specified number of depths. The coarse grained binary tree is then traversed, thereby yielding a canonical code for each symbol, thereby defining the entries for a dynamic Huffman table.

摘要翻译： 一种从包括要压缩的数据的子集的数据样本构建动态霍夫曼表的快速近似的新颖且有用的方法。 计算样本中每个符号的入射频率，然后根据其入射频率将符号分配给预定义的分组。 然后，将这些分组转换成二进制子树，其中二进制子树的叶节点包括与二进制子树相关联的bin的符号。 然后通过嵌套组合二进制子树，从而创建粗粒度二叉树，其中所有叶被映射到指定数量的深度。 然后遍历粗粒二进制树，从而为每个符号产生规范代码，从而为动态霍夫曼表定义条目。

公开(公告)号：US20100020825A1

公开(公告)日：2010-01-28

申请号：US12177440

申请日：2008-07-22

申请人： Brian Mitchell Bass ,  Giora Biran ,  Hubertus Franke ,  Hao Yu

发明人： Brian Mitchell Bass ,  Giora Biran ,  Hubertus Franke ,  Hao Yu

IPC分类号： H04L29/02

CPC分类号： H04L69/04 ,  G06F2221/2105 ,  H04L63/0227

摘要： A method for decompressing multiple data streams includes receiving a packet of data of a compressed data stream, directing the received packet to a selected one of a plurality of decompression functional units within a hardware-based decompression accelerator unit, obtaining decompression state information pertaining to the compressed data stream, and decompressing the received packet using the obtained decompression state information.

摘要翻译： 用于解压缩多个数据流的方法包括：接收压缩数据流的数据分组，将接收的分组引导到基于硬件的解压缩加速器单元内的多个解压缩功能单元中的选定的一个，获得与 压缩数据流，并使用获得的解压缩状态信息对接收的分组进行解压缩。

公开(公告)号：US08244911B2

公开(公告)日：2012-08-14

申请号：US12177440

申请日：2008-07-22

申请人： Brian Mitchell Bass ,  Giora Biran ,  Hubertus Franke ,  Hao Yu

发明人： Brian Mitchell Bass ,  Giora Biran ,  Hubertus Franke ,  Hao Yu

IPC分类号： G06F15/16 ,  H04J3/18

CPC分类号： H04L69/04 ,  G06F2221/2105 ,  H04L63/0227

摘要： A method for decompressing multiple data streams includes receiving a packet of data of a compressed data stream, directing the received packet to a selected one of a plurality of decompression functional units within a hardware-based decompression accelerator unit, obtaining decompression state information pertaining to the compressed data stream, and decompressing the received packet using the obtained decompression state information.

摘要翻译： 用于解压缩多个数据流的方法包括：接收压缩数据流的数据分组，将接收的分组引导到基于硬件的解压缩加速器单元内的多个解压缩功能单元中的选定的一个，获得与 压缩数据流，并使用获得的解压缩状态信息对接收的分组进行解压缩。

公开(公告)号：US08856461B2

公开(公告)日：2014-10-07

申请号：US13217398

申请日：2011-08-25

申请人： Xiao Tao Chang ,  Hubertus Franke ,  Xiaolu Mei ,  Kun Wang ,  Hao Yu

发明人： Xiao Tao Chang ,  Hubertus Franke ,  Xiaolu Mei ,  Kun Wang ,  Hao Yu

IPC分类号： G06F12/00 ,  G06F9/38 ,  G06F15/167 ,  G06F3/00 ,  G06F13/00

CPC分类号： G06F15/167 ,  G06F3/00 ,  G06F9/3877 ,  G06F13/00

摘要： This invention provides a request controlling apparatus, processor and method. The request controlling apparatus is connected to a request storage unit and includes: a queue unit storing flag recording region configured to record a storing flag corresponding to a queue unit in the request storage unit, a comparing means configured to judge whether a incoming first queue unit corresponds to a same message as an already existing queue unit, where the already existing queue unit is in the request storage unit and a flag setting means is configured to set the storing flag corresponding to the already existing queue unit in the queue unit storing flag recording region, to indicate that a message state related to the already existing queue unit will not be stored if the first queue unit corresponds to the same message as in the already existing queue unit.

摘要翻译： 本发明提供了一种请求控制装置，处理器和方法。 所述请求控制装置连接到请求存储单元，包括：队列单元，存储标记记录区域，被配置为在所述请求存储单元中记录与队列单元对应的存储标志;比较装置，被配置为判断进入的第一队列单元 对应于与现有的队列单元相同的消息，其中已经存在的队列单元在请求存储单元中，并且标志设置装置被配置为将对应于已经存在的队列单元的存储标志设置在队列单元存储标志记录中 指示如果第一队列单元对应于与已经存在的队列单元相同的消息，则与现有队列单元相关的消息状态将不被存储。

公开(公告)号：US08677473B2

公开(公告)日：2014-03-18

申请号：US12273142

申请日：2008-11-18

申请人： David Allen Dennerline ,  Hubertus Franke ,  David Paul LaPotin ,  Terry Lee Nelms, II ,  Hao Yu

发明人： David Allen Dennerline ,  Hubertus Franke ,  David Paul LaPotin ,  Terry Lee Nelms, II ,  Hao Yu

IPC分类号： G06F9/00 ,  H04L29/06

CPC分类号： H04L63/0227 ,  H04L43/026 ,  H04L43/16 ,  H04L63/0254 ,  H04L63/1416 ,  H04L63/1433

摘要： Improved techniques are disclosed for use in an intrusion prevention system or the like. For example, a method comprises the following steps performed by a computing element of a network. A packet of a flow is received, the flow comprising a plurality of packets, wherein the plurality of packets represents data in the network. A network intrusion analysis cost-benefit value is determined representing a benefit for analyzing the received packet for intrusions in relation to a cost for analyzing the received packet for intrusions. The method compares the network intrusion analysis cost-benefit value to a network intrusion analysis cost-benefit threshold to determine whether analyzing the received packet for intrusions before forwarding the received packet is warranted. Responsive to a determination that analyzing the received packet for intrusions before forwarding the received packet is not warranted, the received packet is forwarded, an indication is made that subsequent packets of the flow should be forwarded, and a determination is made whether the received packet indicates an intrusion after forwarding the received packet.

摘要翻译： 公开了用于入侵防御系统等的改进的技术。 例如，一种方法包括由网络的计算元件执行的以下步骤。 接收到流的分组，所述流包括多个分组，其中所述多个分组表示网络中的数据。 确定网络入侵分析成本效益值，其代表用于分析入侵的接收分组相对于用于分析所接收的分组的入侵成本的成本的益处。 该方法将网络入侵分析成本效益值与网络入侵分析成本效益阈值进行比较，以确定在转发接收到的分组之前是否分析接收到的攻击包的数据包。 响应于在转发接收到的分组之前分析入侵的接收分组的确定是不合理的，所接收的分组被转发，指示应该转发流的后续分组，并且确定接收到的分组是否指示 转发接收到的数据包后的入侵。