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

1. 发明授权

US07796513B2 Packet classification using modified range labels 失效
标题翻译：数据包分类使用修改的范围标签
公开(公告)号：US07796513B2
公开(公告)日：2010-09-14
申请号：US12187188
申请日：2008-08-06
申请人： Claude Basso , Jean Louis Calvignac , Gordon Taylor Davis , Clark Debs Jeffries
发明人： Claude Basso , Jean Louis Calvignac , Gordon Taylor Davis , Clark Debs Jeffries
IPC分类号： H04L12/26
CPC分类号： H04L45/00 , H04L12/4625 , H04L45/54 , H04L45/7453 , H04L63/0263
摘要： A method and system for encoding a set of range labels for each parameter field in a packet classification key in such a way as to require preferably only a single entry per rule in a final processing stage of a packet classifier. Multiple rules are sorted accorded to their respective significance. A range, based on a parameter in the packet header, is previously determined. Multiple rules are evaluated according to an overlapping of rules according to different ranges. Upon a determination that two or more rules overlap, each overlapping rule is expanded into multiple unique segments that identify unique range intersections. Each cluster of overlapping ranges is then offset so that at least one bit in a range for the rule remains unchanged. The range segments are then converted from binary to Gray code, which results in the ability to determine a CAM entry to use for each range.
摘要翻译：一种方法和系统，用于以分组分类密钥中的每个参数字段的一组范围标签进行编码，以便在分组分类器的最后处理阶段中优选地仅需要每个规则仅一个条目。根据各自的意义对多个规则进行排序。预先确定基于分组报头中的参数的范围。根据不同范围的规则重叠来评估多个规则。在确定两个或更多个规则重叠时，每个重叠规则被扩展为识别唯一范围交点的多个唯一段。然后，每个重叠范围的簇被偏移，使得该规则的范围中的至少一个位保持不变。范围段然后从二进制转换为格雷码，这导致确定每个范围使用的CAM条目的能力。

2. 发明授权

US07466687B2 Packet classification using modified range labels 失效
标题翻译：数据包分类使用修改的范围标签
公开(公告)号：US07466687B2
公开(公告)日：2008-12-16
申请号：US10425097
申请日：2003-04-28
申请人： Claude Basso , Jean Louis Calvignac , Gordon Taylor Davis , Clark Debs Jeffries
发明人： Claude Basso , Jean Louis Calvignac , Gordon Taylor Davis , Clark Debs Jeffries
IPC分类号： H04L12/28
CPC分类号： H04L45/00 , H04L12/4625 , H04L45/54 , H04L45/7453 , H04L63/0263
摘要： A method and system for encoding a set of range labels for each parameter field in a packet classification key in such a way as to require preferably only a single entry per rule in a final processing stage of a packet classifier. Multiple rules are sorted accorded to their respective significance. A range, based on a parameter in the packet header, is previously determined. Multiple rules are evaluated according to an overlapping of rules according to different ranges. Upon a determination that two or more rules overlap, each overlapping rule is expanded into multiple unique segments that identify unique range intersections. Each cluster of overlapping ranges is then offset so that at least one bit in a range for the rule remains unchanged. The range segments are then converted from binary to Gray code, which results in the ability to determine a CAM entry to use for each range.
摘要翻译：一种方法和系统，用于以分组分类密钥中的每个参数字段的一组范围标签进行编码，以便在分组分类器的最后处理阶段中优选地仅需要每个规则仅一个条目。根据各自的意义对多个规则进行排序。预先确定基于分组报头中的参数的范围。根据不同范围的规则重叠来评估多个规则。在确定两个或更多个规则重叠时，每个重叠规则被扩展为识别唯一范围交点的多个唯一段。然后，每个重叠范围的簇被偏移，使得该规则的范围中的至少一个位保持不变。范围段然后从二进制转换为格雷码，这导致确定每个范围使用的CAM条目的能力。

3. 发明授权

US07054855B2 Method and system for performing a pattern match search for text strings 失效
公开(公告)号：US07054855B2
公开(公告)日：2006-05-30
申请号：US09898253
申请日：2001-07-03
申请人： Claude Basso , Jean Louis Calvignac , Philippe Damon , Gordon Taylor Davis , Marco C. Heddes , Clark Debs Jeffries
发明人： Claude Basso , Jean Louis Calvignac , Philippe Damon , Gordon Taylor Davis , Marco C. Heddes , Clark Debs Jeffries
IPC分类号： G06F17/30
CPC分类号： G06F17/30985 , H04L29/12132 , H04L29/12594 , H04L61/1552 , H04L61/30 , Y10S707/99933 , Y10S707/99942
摘要： A method and system for performing a pattern match search for a data string having a plurality of characters separated by delimiters. In accordance with the method of the present invention a search key is constructed by generating a full match search increment comprising the binary representation of a data string element, wherein the data string element comprises all characters between a pair of delimiters. The search key is completed by concatenating a pattern search prefix to the full match search increment, wherein the pattern search prefix is a cumulative pattern search result of each previous full match search increment. A full match search is then performed within a lookup table utilizing the search key. In response to finding a matching pattern within the lookup table, the process returns to constructing a next search key. In response to not finding a matching pattern, the previous full match search result is utilized to process the data string.

4. 发明授权

US07107265B1 Software management tree implementation for a network processor 失效
标题翻译：网络处理器的软件管理树实现
公开(公告)号：US07107265B1
公开(公告)日：2006-09-12
申请号：US09545100
申请日：2000-04-06
申请人： Jean Louis Calvignac , Marco C. Heddes , Clark Debs Jeffries , Piyush Chunilal Patel , Mark Anthony Rinaldi
发明人： Jean Louis Calvignac , Marco C. Heddes , Clark Debs Jeffries , Piyush Chunilal Patel , Mark Anthony Rinaldi
IPC分类号： G06F17/30 , G06F15/00 , G06F9/44
CPC分类号： H04L45/742 , G06F17/30961 , G06F17/30985 , Y10S707/99933 , Y10S707/99936 , Y10S707/99937
摘要： Novel data structures, methods and apparatus for a Software Managed Tree (SMT) which provides a mechanism to create tree structures that follow a search mechanism defined by a control point processor. The search mechanism does not require storage on the previous pointer and uses only a forward pointer along with a next bit or group of bits to test thereby reducing storage space for nodes. The search mechanism processes multiple filter rules for an application without requiring multiple searches and also allows various filter rules to be chained. Two patterns of the same length are stored in each leaf to define a range compare. A compare at the end operation is either a compare under range or a compare under mask. In a compare under range, the input key is checked to determine if it is in the range defined by the two patterns. In a compare under mask, the bits in the input key are compared with the bits in a first leaf pattern under a mask specified in a second leaf pattern.
摘要翻译：用于软件管理树（SMT）的新型数据结构，方法和装置，其提供了一种机制，用于创建遵循由控制点处理器定义的搜索机制的树结构。搜索机制不需要在前一个指针上存储，并且仅使用前向指针以及下一个位或一组位来进行测试，从而减少节点的存储空间。搜索机制处理应用程序的多个过滤器规则，而不需要多次搜索，并且还允许链接各种过滤器规则。在每个叶中存储相同长度的两个图案以定义范围比较。在最终操作中的比较是在范围之下的比较或掩码下的比较。在范围比较范围内，检查输入键以确定是否在两种模式定义的范围内。在掩码下的比较中，将输入密钥中的比特与在第二叶图案中指定的掩码下的第一叶图案中的比特进行比较。

5. 发明授权

US06681364B1 Cyclic redundancy check for partitioned frames 失效
标题翻译：分区帧的循环冗余校验
公开(公告)号：US06681364B1
公开(公告)日：2004-01-20
申请号：US09405669
申请日：1999-09-24
申请人： Jean Louis Calvignac , Clark Debs Jeffries , Fabrice Jean Verplanken
发明人： Jean Louis Calvignac , Clark Debs Jeffries , Fabrice Jean Verplanken
IPC分类号： H03M1300
CPC分类号： H04L1/0061 , H03M13/091 , H04L1/0071 , H04L1/0072
摘要： An improved method and system for generating a frame check sequence. A multiple-bit data string, M, is received in which M is of the form: anbncndnan−1bn−1cn−1dn−1 . . . a2b2c2d2a1b1c1d1. M is thereafter parsed into multiple subframes of the form: anan−1an−2 . . . a2a1; bnbn−1bn−2 . . . b2b1; cncn−1cn−2 . . . c2c1; and dndn−1dn−2 . . . d2d1. The subframes are padded with zeros resulting in subframes of the form: an000an−1000an−2000 . . . a2000a1000; 0bn000bn−1000bn−200 . . . 0b2000b100; 00cn000cn−1000cn−20 . . . 00c2000c100; and 000dn000dn−1000dn−2 . . . 000d2000d1. A partial check sum is then generated for each of the multiple subframes. Finally, each of the partial check sums are added together such that a frame check sequence for M is obtained.
摘要翻译：一种用于生成帧校验序列的改进的方法和系统。接收多位数据串M，其中M具有以下形式：M随后被解析为形式的多个子帧：并且子帧用零填充，产生以下形式的子帧：然后生成部分校验和对于多个子帧中的每一个。最后，将每个部分校验和相加在一起，从而获得用于M的帧校验序列。

6. 发明授权

US06498781B1 Self-tuning link aggregation system 失效
标题翻译：自调整链路聚合系统
公开(公告)号：US06498781B1
公开(公告)日：2002-12-24
申请号：US09374003
申请日：1999-08-13
申请人： Brian Mitchell Bass , Jean Louis Calvignac , Marco C. Heddes , Clark Debs Jeffries , Loren Douglas Larsen , Jeffrey James Lynch , Mark Anthony Rinaldi , Michael Steven Siegel
发明人： Brian Mitchell Bass , Jean Louis Calvignac , Marco C. Heddes , Clark Debs Jeffries , Loren Douglas Larsen , Jeffrey James Lynch , Mark Anthony Rinaldi , Michael Steven Siegel
IPC分类号： H04L1226
CPC分类号： H04L41/5025 , H04L43/0829 , H04L43/16
摘要： A data processing system and method in a computer network are disclosed for improving performance of a link aggregation system included in the network. Parameters are established which are utilized to determine performance criteria of the link aggregation system. A performance of the link aggregation system is determined by determining the performance criteria. The performance of the link aggregation system changes in response to a flow traffic burden on the link aggregation system changing. The link aggregation system dynamically modifies the parameters in response to the changing performance of the link aggregation system. The link aggregation system is self-tuning and capable of automatically adjusting to a changing flow traffic burden on the link aggregation system.
摘要翻译：公开了一种计算机网络中的数据处理系统和方法，用于改善网络中包括的链路聚合系统的性能。建立了用于确定链路聚合系统性能标准的参数。通过确定性能标准来确定链路聚合系统的性能。链路聚合系统的性能响应链路聚合系统的流量负担变化而变化。链路聚合系统根据链路聚合系统的性能变化动态修改参数。链路聚合系统是自调整的，能够自动调整链路聚合系统上流量流量负担的变化。

7. 发明授权

US06785278B1 Methods, systems and computer program products for hashing address values 失效
标题翻译：用于散列地址值的方法，系统和计算机程序产品
公开(公告)号：US06785278B1
公开(公告)日：2004-08-31
申请号：US09210222
申请日：1998-12-10
申请人： Jean Louis Calvignac , Marco C. Heddes , Clark Debs Jeffries , Ross Boyd Leavens , Gerald Arnold Marin , Piyush Chunilal Patel , Atef Omar Zaghloul
发明人： Jean Louis Calvignac , Marco C. Heddes , Clark Debs Jeffries , Ross Boyd Leavens , Gerald Arnold Marin , Piyush Chunilal Patel , Atef Omar Zaghloul
IPC分类号： H04L1228
CPC分类号： H04L12/4625 , H04L45/745
摘要： Methods systems and computer program products are provided for hashing address values that exhibit banding in a plurality of regions of an address space defined by at least two segments of the address values, by performing at least one of a translation and a rotation of the at least two segments to thereby map the at least two segments from the plurality of regions to one of the plurality of regions.
摘要翻译：提供了方法系统和计算机程序产品，用于通过执行至少一个地址值的平移和旋转中的至少一个来散列地址值，所述地址值在由地址值的至少两个段定义的地址空间的多个区域中呈现带状从而将多个区域中的至少两个区段映射到多个区域中的一个区域。

8. 发明授权

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.
摘要翻译：公开了一种用于测试计算机系统中的多个过滤规则的方法和系统。多个过滤器规则使用至少一个维度中的至少一个值范围。每个范围包括最小值和最大值。过滤器规则与密钥一起使用。该方法和系统包括基于每个范围的最小值和最大值来减少所需的测试量，以确保密钥可以匹配一部分过滤规则并根据过滤器规则的部分测试密钥。在一个方面，所述方法和系统包括确定过滤器规则的至少一个子集并且针对每个子集测试该密钥以确定密钥是否匹配子集的过滤规则。滤波器规则的子集在至少第二维度上是不相交的，并且基于第二维度中每个范围的最小值和最大值。在另一方面，所述方法和系统包括为多个间隔集合的每个间隔集合提供至少一个比特，并且基于所述间隔集合为所述过滤规则提供决策树。该位表征每个间隔集。决策树包括具有至少一个节点的叶路径，并且用于隔离叶路径上的多个过滤规则的一部分。决策树的每个节点都使用至少一位的位。

9. 发明授权

US06657962B1 Method and system for managing congestion in a network 失效
标题翻译：管理网络拥塞的方法和系统
公开(公告)号：US06657962B1
公开(公告)日：2003-12-02
申请号：US09546651
申请日：2000-04-10
申请人： Peter Irma August Barri , Brian Mitchell Bass , Jean Louis Calvignac , Ivan Oscar Clemminck , Marco C. Heddes , Clark Debs Jeffries , Michael Steven Siegel , Fabrice Jean Verplanken , Miroslav Vrana
发明人： Peter Irma August Barri , Brian Mitchell Bass , Jean Louis Calvignac , Ivan Oscar Clemminck , Marco C. Heddes , Clark Debs Jeffries , Michael Steven Siegel , Fabrice Jean Verplanken , Miroslav Vrana
IPC分类号： H04L1256
CPC分类号： H04L47/2441 , H04L47/10 , H04L47/12 , H04L47/30 , H04L47/32 , H04L49/103 , H04L49/3018 , H04L49/50 , H04L49/90
摘要： A system for minimizing congestion in a communication system is disclosed. The system comprises at least one ingress system for providing data. The ingress system includes a first free queue and a first flow queue. The system also includes a first congestion adjustment module for receiving congestion indications from the free queue and the flow queue. The first congestion adjustment module generates end stores transmit probabilities and performs per packet flow control actions. The system further includes a switch fabric for receiving data from the ingress system and for providing a congestion indication to the ingress system. The system further includes at least one egress system for receiving the data from the switch fabric. The egress system includes a second free queue and a second flow queue. The system also includes a second congestion adjustment module for receiving congestion indications from the second free queue and the second flow queue. The second congestion adjustment module generates and stores transmit probabilities and performs per packet flow control actions. Finally, the system includes a scheduler for determining the order and timing of transmission of packets out the egress system and to another node or destination. A method and system in accordance with the present invention provides for a unified method and system for logical connection of congestion with the appropriate flow control responses. The method and system utilizes congestion indicators within the ingress system, egress system, and the switch fabric in conjunction with a coarse adjustment system and fine adjustment system within the ingress device and the egress device to intelligently manage the system.
摘要翻译：公开了一种用于最小化通信系统中的拥塞的系统。该系统包括用于提供数据的至少一个入口系统。入口系统包括第一空闲队列和第一流队列。该系统还包括用于从空闲队列和流队列接收拥塞指示的第一拥塞调整模块。第一拥塞调整模块生成终端存储发送概率并执行每个分组流控制动作。该系统还包括用于从入口系统接收数据并向入口系统提供拥塞指示的交换结构。该系统还包括用于从交换结构接收数据的至少一个出口系统。出口系统包括第二空闲队列和第二流队列。该系统还包括第二拥塞调整模块，用于从第二空闲队列和第二流队列接收拥塞指示。第二拥塞调整模块生成并存储发送概率，并执行每个分组流控制动作。最后，该系统包括一个调度器，用于确定出口系统和另一个节点或目的地的分组传输的顺序和定时。根据本发明的方法和系统提供了用于将拥塞与适当流控制响应逻辑连接的统一方法和系统。该方法和系统利用入口系统，出口系统和交换结构中的拥塞指示符与入口设备和出口设备内的粗调系统和精细调整系统结合，智能地管理系统。

10. 发明授权

US06298340B1 System and method and computer program for filtering using tree structure 失效
标题翻译：使用树结构进行过滤的系统和方法以及计算机程序
公开(公告)号：US06298340B1
公开(公告)日：2001-10-02
申请号：US09312148
申请日：1999-05-14
申请人： Jean Louis Calvignac , Everett Arthur Corl, Jr. , Anthony Matteo Gallo , Marco C. Heddes , Clark Debs Jeffries , Piyush Chunilal Patel , Mark Anthony Rinaldi , Colin Beaton Verrilli
发明人： Jean Louis Calvignac , Everett Arthur Corl, Jr. , Anthony Matteo Gallo , Marco C. Heddes , Clark Debs Jeffries , Piyush Chunilal Patel , Mark Anthony Rinaldi , Colin Beaton Verrilli
IPC分类号： G06F1730
CPC分类号： G06F17/30961 , Y10S707/99931 , Y10S707/99933 , Y10S707/99943 , Y10S707/99944
摘要： A classification system includes a software managed tree testing bits from a key which labels an item. The bits are chosen by application of the Choice Bit Algorithm to the Rules in a Database of Rules. A controller including logic parses an unknown Key for bits to be tested in the decision nodes of a binary tree. Tests dictated by the tree are conducted in a predetermined way until all but one Rule from the database or all but a few Rules from the database are eliminated from consideration, whereupon the Key is fully tested by the one remaining Rule or in a lattice constructed of the remaining plurality of Rules, to determine an action to enforce on the item. Certain compare tests are used in the binary tree for the case that otherwise identical or similar rules are applied to integer ranges of key values which do not fall upon power of 2 boundaries. Furthermore, some very frequently occurring rules in such final tests might be designated as secondary rules, the remaining rules designated as primary rules, the entire decision tree recalculated using only primary rules, and the primary rules then connected to secondary rules only when logically necessary by means of a system of pointers making use of relative priorities of rules.
摘要翻译：分类系统包括从标签项目的键的软件管理树测试位。通过将选择位算法应用于规则数据库中的规则来选择位。包含逻辑的控制器在二叉树的决策节点中解析要测试的位的未知密钥。由树进行的测试以预定的方式进行，直到从数据库中除了一个规则之外的所有除了数据库中的所有规则或从数据库中除了少数几个规则之外的所有测试都被消除，由此Key被完整的一个规则或由剩余的多个规则，以确定对该项目执行的操作。在二叉树中使用某些比较测试，否则相同或相似的规则应用于不落在2边界的幂的关键值的整数范围。此外，这些最终测试中的一些非常频繁出现的规则可能被指定为次要规则，剩余的规则被指定为主要规则，仅使用主要规则重新计算的整个决策树，然后仅在逻辑上必要时连接到次级规则的主要规则使用指针的相对优先级的指针系统的手段。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式