专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

71. 发明申请

US20120151307A1 CHECKSUM VERIFICATION ACCELERATOR 失效
标题翻译：检查验证加速器
公开(公告)号：US20120151307A1
公开(公告)日：2012-06-14
申请号：US13302688
申请日：2011-11-22
申请人： Francois Abel , Claude Basso , Jean L. Calvignac , Natarajan Vaidhyanathan , Fabrice Verplanken
发明人： Francois Abel , Claude Basso , Jean L. Calvignac , Natarajan Vaidhyanathan , Fabrice Verplanken
IPC分类号： G06F11/00
CPC分类号： H04L1/0079 , H04L1/0061 , H04L1/0072
摘要： Disclosed is a method and system for validating a data packet by a network processor supporting a first network protocol and a second network protocol and utilizing shared hardware. The network processor receives a data packet; identifies a network packet protocol for the data packet; and processes the data packet according to the network packet protocol comprising: updating a first register with a first partial packet length specific to the first network protocol; updating a second register with a second partial packet length specific to the second network protocol; and updating a third register with a first checksum computed from fields independent of the network protocol. The system produces a second checksum utilizing a function that combines values from the first register, the second register, and the third register. The system validates the data packet by comparing the data packet checksum to the second checksum.
摘要翻译：公开了一种用于通过支持第一网络协议和第二网络协议的网络处理器来验证数据分组并利用共享硬件的方法和系统。网络处理器接收数据包; 识别数据包的网络包协议; 并根据网络分组协议对数据分组进行处理，包括：以第一网络协议特有的第一部分分组长度更新第一寄存器; 用第二网络协议特有的第二部分分组长度更新第二寄存器; 以及用独立于网络协议的字段计算的具有第一校验和的更新第三寄存器。该系统利用组合来自第一寄存器，第二寄存器和第三寄存器的值的函数产生第二校验和。系统通过将数据包校验和与第二个校验和进行比较来验证数据包。

72. 发明申请

US20120300630A1 IDENTIFICATION OF QOS CLASSIFICATION BASED ON PACKET ATTRIBUTES 有权
标题翻译：基于分组属性的QOS分类识别
公开(公告)号：US20120300630A1
公开(公告)日：2012-11-29
申请号：US13302489
申请日：2011-11-22
申请人： Francois Abel , Claude Basso , Jean L. Calvignac , Natarajan Vaidhyanathan , Fabrice Verplanken , Colin B. Verrilli
发明人： Francois Abel , Claude Basso , Jean L. Calvignac , Natarajan Vaidhyanathan , Fabrice Verplanken , Colin B. Verrilli
IPC分类号： H04L12/24
CPC分类号： H04L47/2441 , H04L69/22
摘要： A method, a system, and a computer program product is disclosed for identifying a quality of service (QoS) classification of a packet in a network by a network processor. The method comprising: providing a table wherein a priority value with a maximum of N values is used as an index into the table to retrieve a QoS classification having a maximum of M values with M less than N; receiving a data packet in a stream of data packets; extracting at least two priority indicator values from the packet; converting the at least two priority indicator values into a priority value; utilizing the priority value as an index into the table; extracting the entry in the table corresponding to the priority value as the QoS classification of the packet; and utilizing the QoS classification for subsequent processing of the data packet.
摘要翻译：公开了一种方法，系统和计算机程序产品，用于通过网络处理器来识别网络中的分组的服务质量（QoS）分类。该方法包括：提供一个表，其中将具有最大N个值的优先级值用作表中的索引以检索具有M小于N的最大M个值的QoS分类; 在数据包流中接收数据包; 从分组中提取至少两个优先级指示符值; 将所述至少两个优先级指示符值转换为优先级值; 利用优先级值作为表中的索引; 提取对应于优先级值的表中的条目作为分组的QoS分类; 并利用QoS分类来对数据分组进行后续处理。

73. 发明授权

US07103822B2 Method and apparatus for computing ‘N-bit at a time’ CRC's of data frames of lengths not multiple of N 失效
标题翻译：用于计算“N位数据”CRC的长度不是N倍的数据帧的方法和装置
公开(公告)号：US07103822B2
公开(公告)日：2006-09-05
申请号：US10248010
申请日：2002-12-10
申请人： Rene Glaise , Fabrice Verplanken
发明人： Rene Glaise , Fabrice Verplanken
IPC分类号： H03M13/00
CPC分类号： H04L1/0061 , H03M13/091 , H04L1/0083
摘要： The present invention discloses CRC checking ‘N-bit at a time’ of data frames of lengths not necessarily in a multiple of the N-bit. While receiving the data frame, the data frame length is extracted from the protocol header and a misalignment is computed versus the ‘N-bit at a time’ value. Simultaneously, CRC is computed on each received N-bit of the data frame and an FCS register is updated. At each cycle, a checking is performed to know whether the data frame length has been extracted from the protocol header. While the data frame length is not yet known and more bits are left to process, the data frame is continued to be received and computed ‘N-bit at a time’. When the data frame length is known and no more bits are to be processed, the current value of the FCS register is compared to a pre-stored vector corresponding to the misalignment. If a match occurs, checking of the data frame passes and the data frame is accepted. If a match does not occur, checking of the data frame fails and the data frame may be rejected. Therefore, the present invention is capable of computing CRC of a data frame ‘N-bit at a time’ while the data frame length is not yet known.
摘要翻译：本发明公开了一种不一定是N比特倍数的数据帧的CRC校验“N位”。在接收数据帧的同时，从协议报头中提取数据帧长度，并且计算出与“N位在一个时间”值相对的未对准。同时，对数据帧的每个接收到的N位计算CRC，并更新FCS寄存器。在每个周期，执行检查以知道数据帧长度是否已经从协议报头提取。虽然数据帧长度还不知道，还有更多的位要进行处理，但是数据帧继续被接收并且被计算为“一次N位”。当数据帧长度已知并且不再处理比特时，将FCS寄存器的当前值与对准于未对准的预存矢量进行比较。如果发生匹配，则检查数据帧并通过数据帧。如果不发生匹配，则检查数据帧失败，数据帧可能被拒绝。因此，本发明能够在数据帧长度尚未知的情况下计算数据帧“一次的N位”的CRC。

74. 发明授权

US5912881A Method and apparatus for fast checking the frame check sequence of a segmented message 失效
标题翻译：用于快速检查分段消息的帧校验序列的方法和装置
公开(公告)号：US5912881A
公开(公告)日：1999-06-15
申请号：US754562
申请日：1996-11-21
申请人： R Glaise , Eric Lallemand , Gilles Toubol , Fabrice Verplanken
发明人： R Glaise , Eric Lallemand , Gilles Toubol , Fabrice Verplanken
IPC分类号： G06F13/00 , G06F11/10 , H03M13/00 , H03M13/09 , H04L1/00 , H04L12/56 , H04J3/24
CPC分类号： H03M13/091 , H04L1/0083 , H04L2012/5652
摘要： A process and an apparatus to calculate the FCS (Frame Check Sequence) error checking code of a message sent over a connection and segmented into a finite number of packets in a fixed size packets network. The process is implemented in the adapter cards of the ATM network access nodes (2, 4) located at the boundary of the ATM network. These nodes, when supporting AAL5 type ATM connections, reassemble messages which have been segmented at the entry of the network and to calculate the FCS of the message cell payloads for data integrity checking. The process of the invention starts at each reception of a cell with the calculation of a partial FCS (10) performed in parallel to the connection control block fetching phase (40); these 2 parallel operations allow FCS checking during the cell processing time of connections established over medium and high speed lines.
摘要翻译：计算通过连接发送并在固定大小的分组网络中分段成有限数量的分组的消息的FCS（帧校验序列）错误校验码的过程和装置。该过程在位于ATM网络边界处的ATM网络接入节点（2,4）的适配卡中实现。当支持AAL5型ATM连接时，这些节点重新组合已经在网络入口处被分段的消息，并且计算用于数据完整性检查的消息小区有效载荷的FCS。本发明的过程开始于每个小区的接收，计算与连接控制块提取阶段（40）并行执行的部分FCS（10）。这两个并行操作允许在通过中速和高速线路建立的连接的单元处理时间期间进行FCS检查。

75. 发明申请

US20120147892A1 ANALYSIS OF NETWORK PACKETS USING A GENERATED HASH CODE 审中-公开
标题翻译：使用生成的哈希码对网络分组进行分析
公开(公告)号：US20120147892A1
公开(公告)日：2012-06-14
申请号：US13325597
申请日：2011-12-14
申请人： Claude Basso , Jean L. Calvignac , Natarajan Vaidhyanathan , Fabrice Verplanken
发明人： Claude Basso , Jean L. Calvignac , Natarajan Vaidhyanathan , Fabrice Verplanken
IPC分类号： H04L12/56
CPC分类号： H04L45/74 , H04L69/22
摘要： A technique for analyzing network packets includes receiving, by a network processor, a network packet having a packet header including address and control information. A set of bytes are extracted, using the network processor, from the packet header and a set of input bits for generating a hash code are derived, using the network processor, from the set of bytes. Finally, the hash code is generated using the input bits.
摘要翻译：用于分析网络分组的技术包括由网络处理器接收具有包含地址和控制信息的分组报头的网络分组。使用网络处理器从分组报头提取一组字节，并且使用网络处理器从该组字节导出用于生成散列码的一组输入比特。最后，使用输入位生成哈希码。

76. 发明授权

US06539394B1 Method and system for performing interval-based testing of filter rules 失效
标题翻译：用于执行过滤器规则的基于间隔的测试的方法和系统
公开(公告)号：US06539394B1
公开(公告)日：2003-03-25
申请号：US09477578
申请日：2000-01-04
申请人： Jean Louis Calvignac , Clark Debs Jeffries , Fabrice Verplanken
发明人： Jean Louis Calvignac , Clark Debs Jeffries , Fabrice Verplanken
IPC分类号： G06F1730
CPC分类号： H04L63/02 , H04L43/50 , H04L63/0227 , H04L63/0263 , H04L63/04 , Y10S707/99943
摘要： A method and system for testing a plurality of filter rules in a computer system is disclosed. The plurality of filter rules uses at least one range of values in at least one dimension. Each range includes a minimum and a maximum value. The filter rules are used with a key. The method and system include reducing an amount of testing required based on the minimum and maximum value of each range to ensure that the key can match a portion of the filter rules and testing the key against the portion of the filter rules. In one aspect, the method and system include determining at least one subset of filter rules and testing the key against each subset to determine whether the key matches a filter rule of a subset. The subset of filter rules is non-intersecting in at least a second dimension and is based on the minimum value and the maximum value of each range in the second dimension. In another aspect, the method and system include providing at least one bit for each interval set of a plurality of interval sets and providing a decision tree for the filter rules based on the interval sets. The bit characterizes each interval set. The decision tree includes leaf paths having at least one node and is for isolating a portion of the plurality of filter rules on a leaf path. Each node of the decision tree utilizes a bit of the at least one bit.
摘要翻译：公开了一种用于测试计算机系统中的多个过滤规则的方法和系统。多个过滤器规则使用至少一个维度中的至少一个值范围。每个范围包括最小值和最大值。过滤器规则与密钥一起使用。该方法和系统包括基于每个范围的最小值和最大值来减少所需的测试量，以确保密钥可以匹配一部分过滤规则并根据过滤器规则的部分测试密钥。在一个方面，所述方法和系统包括确定过滤器规则的至少一个子集并且针对每个子集测试该密钥以确定密钥是否匹配子集的过滤规则。滤波器规则的子集在至少第二维度上是不相交的，并且基于第二维度中每个范围的最小值和最大值。在另一方面，所述方法和系统包括为多个间隔集合的每个间隔集合提供至少一个比特，并且基于所述间隔集合为所述过滤规则提供决策树。该位表征每个间隔集。决策树包括具有至少一个节点的叶路径，并且用于隔离叶路径上的多个过滤规则的一部分。决策树的每个节点都使用至少一位的位。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式