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

11. 发明授权

US07478426B2 Multi-field classification dynamic rule updates 失效
标题翻译：多字段分类动态规则更新
公开(公告)号：US07478426B2
公开(公告)日：2009-01-13
申请号：US10894628
申请日：2004-07-20
申请人： Everett A. Corl, Jr. , Gordon T. Davis , Clark D. Jeffries
发明人： Everett A. Corl, Jr. , Gordon T. Davis , Clark D. Jeffries
IPC分类号： G06F15/16 , G06F9/00
CPC分类号： H04L43/16 , H04L43/18 , H04L49/25 , H04L63/0263
摘要： The present invention relates to a method and computer system device for applying a plurality of rules to data packets within a network computer system. A filter rule decision tree is updated by adding or deleting a rule. If deleting a filter rule then the decision tree is provided to a network data plane processor with an incremental delete of the filter rule. If adding a filter rule then either providing an incremental insertion of the filter rule to the decision tree or rebuilding the first decision tree into a second decision tree responsive to comparing a parameter to a threshold. In one embodiment the parameter and thresholds relate to depth values of the tree filter rule chained branches. In another the parameter and thresholds relate to a total count of rule additions since a building of the relevant tree.
摘要翻译：本发明涉及一种用于将多个规则应用于网络计算机系统内的数据分组的方法和计算机系统设备。通过添加或删除规则来更新过滤规则决策树。如果删除过滤规则，则将决策树提供给具有过滤规则的增量删除的网络数据平面处理器。如果添加过滤规则，则响应于将参数与阈值进行比较，提供过滤规则的增量插入到决策树或将第一决策树重新构建到第二决策树中。在一个实施例中，参数和阈值涉及树筛选器规则链分支的深度值。在另一个中，参数和阈值涉及自相关树的建立以来的规则添加的总计数。

12. 发明申请

US20080298244A1 APPARATUS AND METHOD FOR CACHING LOOKUPS BASED UPON TCP TRAFFIC FLOW CHARACTERISTICS 失效
标题翻译：基于TCP流量特性的查询语言的设备和方法
公开(公告)号：US20080298244A1
公开(公告)日：2008-12-04
申请号：US12188333
申请日：2008-08-08
申请人： Everett A. Corl, JR. , Gordon T. Davis , Clark D. Jeffries , Natarajan Vaidhyanathan , Colin B. Verrilli
发明人： Everett A. Corl, JR. , Gordon T. Davis , Clark D. Jeffries , Natarajan Vaidhyanathan , Colin B. Verrilli
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L69/22
摘要： The classification system of a network device includes a cache in which a mapping between predefined characteristics of TCP/IP packets and associated actions are stored in response to the first “Frequent Flyer” packet in of a session. Selected characteristics from subsequent received packets of that session are correlated with the predefined characteristics and the stored actions are applied to the received packets if the selected characteristics and the predefined characteristics match, thus reducing the processing required for subsequent packets. The packets selected for caching may be data packets. For mismatched characteristics, the full packet search of the classification system is used to determine the action to apply to the received packet.
摘要翻译：网络设备的分类系统包括缓存，其中响应于会话中的第一“频繁传单”分组而存储TCP / IP分组的预定义特性与相关动作之间的映射。如果所选择的特征和预定义的特征匹配，则从该会话的后续接收到的分组中选出的特征与预定义的特征相关联，并且将存储的动作应用于所接收的分组，从而减少后续分组所需的处理。选择用于缓存的数据包可能是数据包。对于不匹配的特征，分类系统的全分组搜索用于确定应用于接收到的分组的动作。

13. 发明授权

US08005989B2 Caching lookups based upon TCP traffic flow characteristics 失效
标题翻译：基于TCP流量特性的缓存查找
公开(公告)号：US08005989B2
公开(公告)日：2011-08-23
申请号：US12188333
申请日：2008-08-08
申请人： Everett A. Corl, Jr. , Gordon T. Davis , Clark D. Jeffries , Natarajan Vaidhyanathan , Colin B. Verrilli
发明人： Everett A. Corl, Jr. , Gordon T. Davis , Clark D. Jeffries , Natarajan Vaidhyanathan , Colin B. Verrilli
IPC分类号： G06F15/173
CPC分类号： H04L45/00 , H04L69/22
摘要： The classification system of a network device includes a cache in which a mapping between predefined characteristics of TCP/IP packets and associated actions are stored in response to the first “Frequent Flyer” packet in of a session. Selected characteristics from subsequent received packets of that session are correlated with the predefined characteristics and the stored actions are applied to the received packets if the selected characteristics and the predefined characteristics match, thus reducing the processing required for subsequent packets. The packets selected for caching may be data packets. For mismatched characteristics, the full packet search of the classification system is used to determine the action to apply to the received packet.
摘要翻译：网络设备的分类系统包括缓存，其中响应于会话中的第一“频繁传单”分组而存储TCP / IP分组的预定义特性与相关动作之间的映射。如果所选择的特征和预定义的特征匹配，则从该会话的后续接收到的分组中选出的特征与预定义的特征相关联，并且将存储的动作应用于所接收的分组，从而减少后续分组所需的处理。选择用于缓存的数据包可能是数据包。对于不匹配的特征，分类系统的全分组搜索用于确定应用于接收到的分组的动作。

14. 发明授权

US07937355B2 Decision tree multi-field classification dynamic rules updating and rebuilding 失效
标题翻译：决策树多场分类动态规则更新和重建
公开(公告)号：US07937355B2
公开(公告)日：2011-05-03
申请号：US12327115
申请日：2008-12-03
申请人： Everett A. Corl, Jr. , Gordon T. Davis , Clark D. Jeffries
发明人： Everett A. Corl, Jr. , Gordon T. Davis , Clark D. Jeffries
IPC分类号： G06F17/00 , G06F9/00 , G06F15/16 , G06F15/173 , G06N5/02
CPC分类号： H04L43/16 , H04L43/18 , H04L49/25 , H04L63/0263
摘要： The present invention relates to a method and computer system device for applying a plurality of rules to data packets within a network computer system. A filter rule decision tree is updated by adding or deleting a rule. If deleting a filter rule then the decision tree is provided to a network data plane processor with an incremental delete of the filter rule. If adding a filter rule then either providing an incremental insertion of the filter rule to the decision tree or rebuilding the first decision tree into a second decision tree responsive to comparing a parameter to a threshold. In one embodiment the parameter and thresholds relate to depth values of the tree filter rule chained branches. In another the parameter and thresholds relate to a total count of rule additions since a building of the relevant tree.
摘要翻译：本发明涉及一种用于将多个规则应用于网络计算机系统内的数据分组的方法和计算机系统设备。通过添加或删除规则来更新过滤规则决策树。如果删除过滤规则，则将决策树提供给具有过滤规则的增量删除的网络数据平面处理器。如果添加过滤规则，则响应于将参数与阈值进行比较，提供过滤规则的增量插入到决策树或将第一决策树重新构建到第二决策树中。在一个实施例中，参数和阈值涉及树筛选器规则链分支的深度值。在另一个中，参数和阈值涉及自相关树的建立以来的规则添加的总计数。

15. 发明授权

US07464181B2 Method for caching lookups based upon TCP traffic flow characteristics 有权
标题翻译：基于TCP流量特征缓存查找的方法
公开(公告)号：US07464181B2
公开(公告)日：2008-12-09
申请号：US10662007
申请日：2003-09-11
申请人： Everett A. Corl, Jr. , Gordon T. Davis , Clark D. Jeffries , Natarajan Vaidhyanathan , Colin B. Verrilli
发明人： Everett A. Corl, Jr. , Gordon T. Davis , Clark D. Jeffries , Natarajan Vaidhyanathan , Colin B. Verrilli
IPC分类号： G06F15/173 , G06F15/16 , G06F12/00
CPC分类号： H04L45/00 , H04L69/22
摘要： The classification system of a network device includes a cache in which a mapping between predefined characteristics of TCP/IP packets and associated actions are stored in response to the first “Frequent Flyer” packet in of a session. Selected characteristics from subsequent received packets of that session are correlated with the predefined characteristics and the stored actions are applied to the received packets if the selected characteristics and the predefined characteristics match, thus reducing the processing required for subsequent packets. The packets selected for caching may be data packets. For mismatched characteristics, the full packet search of the classification system is used to determine the action to apply to the received packet.
摘要翻译：网络设备的分类系统包括缓存，其中响应于会话中的第一“频繁传单”分组而存储TCP / IP分组的预定义特性与相关动作之间的映射。如果所选择的特征和预定义的特征匹配，则从该会话的后续接收到的分组中选出的特征与预定义的特征相关联，并且将存储的动作应用于所接收的分组，从而减少后续分组所需的处理。选择用于缓存的数据包可能是数据包。对于不匹配的特征，分类系统的全分组搜索用于确定应用于接收到的分组的动作。

16. 发明申请

US20090125535A1 STRUCTURE FOR DELETING LEAVES IN TREE TABLE STRUCTURES 失效
标题翻译：树木结构中的叶片结构
公开(公告)号：US20090125535A1
公开(公告)日：2009-05-14
申请号：US12350493
申请日：2009-01-08
申请人： Claude Basso , Jean L. Calvignac , Gordon T. Davis , Marco Heddes , Piyush C. Patel , Steven R. Perrin , Grayson W. Randall , Sonia K. Rovner
发明人： Claude Basso , Jean L. Calvignac , Gordon T. Davis , Marco Heddes , Piyush C. Patel , Steven R. Perrin , Grayson W. Randall , Sonia K. Rovner
IPC分类号： G06F17/30
CPC分类号： G06F17/30625 , Y10S707/99936 , Y10S707/99942 , Y10S707/99943
摘要： Techniques and articles of manufacture are provided comprising computer readable programs that, when executed on the computer, cause the computer to delete a leaf from a Patricia tree having a direct table and a plurality of PSCB's which decode portions of the pattern of a leaf in the tree without shutting down the functioning of the tree. A leaf having a pattern is identified as a leaf to be deleted. Using the pattern, the tree is walked to identify the location of the leaf to be deleted. The leaf to be deleted is identified and deleted, and any relevant PSCB modified, if necessary. The technique also is applicable to deleting a prefix of a prefix.
摘要翻译：提供了技术和制造物品，其包括计算机可读程序，当在计算机上执行时，计算机可以使计算机从具有直接表的帕特里夏树中删除叶片，并且多个PSCB解码部分叶片的图案树，而不关闭树的功能。具有图案的叶被识别为要被删除的叶。使用图案，树被移动以识别要删除的叶子的位置。要删除的叶被识别和删除，并且必要时修改任何相关的PSCB。该技术也适用于删除前缀的前缀。

17. 发明授权

US07490101B2 Method and structure for deleting leaves in tree table structures 失效
标题翻译：在树表结构中删除树叶的方法和结构
公开(公告)号：US07490101B2
公开(公告)日：2009-02-10
申请号：US11462404
申请日：2006-08-04
申请人： Claude Basso , Jean L. Calvignac , Gordon T. Davis , Marco Heddes , Piyush C. Patel , Steven R. Perrin , Grayson W. Randall , Sonia K. Rovner
发明人： Claude Basso , Jean L. Calvignac , Gordon T. Davis , Marco Heddes , Piyush C. Patel , Steven R. Perrin , Grayson W. Randall , Sonia K. Rovner
IPC分类号： G06F7/00 , G06F17/00 , G06F17/30
CPC分类号： G06F17/30625 , Y10S707/99936 , Y10S707/99942 , Y10S707/99943
摘要： A technique is provided to delete a leaf from a Patricia tree having a direct table and a plurality of PSCB's which decode portions of the pattern of a leaf in the tree without shutting down the functioning of the tree. A leaf having a pattern is identified as a leaf to be deleted. Using the pattern, the tree is walked to identify the location of the leaf to be deleted. The leaf to be deleted is identified and deleted, and any relevant PSCB modified, if necessary. The technique also is applicable to deleting a prefix of a prefix.
摘要翻译：提供一种技术来从具有直接表的帕特里夏树和多个PSCB中删除叶，该PSCB解码树中的叶的图案的部分，而不关闭树的功能。具有图案的叶被识别为要被删除的叶。使用图案，树被移动以识别要删除的叶子的位置。要删除的叶被识别和删除，并且必要时修改任何相关的PSCB。该技术也适用于删除前缀的前缀。

18. 发明授权

US07089240B2 Longest prefix match lookup using hash function 失效
公开(公告)号：US07089240B2
公开(公告)日：2006-08-08
申请号：US10879964
申请日：2004-06-29
申请人： Claude Basso , Jean L. Calvignac , Gordon T. Davis , Piyush C. Patel
发明人： Claude Basso , Jean L. Calvignac , Gordon T. Davis , Piyush C. Patel
IPC分类号： G06F17/30
CPC分类号： H04L45/00 , G06F17/30985 , H04L12/66 , H04L45/745 , H04L45/7457 , Y10S707/99933 , Y10S707/99935 , Y10S707/99936
摘要： A method and apparatus are used for finding the longest prefix match in a variable length prefix search when searching a direct table within a routing table structure of a network processor. The search through the routing table structure is expedited by hashing a first segment of an internet protocol address with a virtual private network number followed by concatenating the unhashed bits of the IP address to the result of the hash operation to form an input key. Patterns are compared a bit at a time until an exact match or the best match is found. The search is conducted in a search tree that provides that the matching results will be the best possible match.

19. 发明授权

US07149749B2 Method of inserting and deleting leaves in tree table structures 失效
标题翻译：在树表结构中插入和删除叶子的方法
公开(公告)号：US07149749B2
公开(公告)日：2006-12-12
申请号：US10453245
申请日：2003-06-03
申请人： Claude Basso , Jean L. Calvignac , Gordon T. Davis , Marco Heddes , Piyush C. Patel , Steven R. Perrin , Grayson W. Randall , Sonia K. Rovner
发明人： Claude Basso , Jean L. Calvignac , Gordon T. Davis , Marco Heddes , Piyush C. Patel , Steven R. Perrin , Grayson W. Randall , Sonia K. Rovner
IPC分类号： G06F17/30
CPC分类号： G06F17/30625 , Y10S707/99936 , Y10S707/99942 , Y10S707/99943
摘要： A technique is provided to either insert or delete a leaf in a Patricia tree having a direct table and a plurality of PSCB's which decode portions of the pattern of a leaf in the tree without shutting down the functioning of the tree. A leaf having a pattern is identified as either a leaf to be inserted or deleted. Using the pattern, the tree is walked once to identify the location of the leaf to be deleted or the location where the leaf is to be inserted. If it is a delete operation, the leaf to be deleted is identified and deleted, and any relevant PSCB modified, if necessary. If it is an insert operation, the tree is walked a second time to insert the leaf and reform or create any PSCB in the chain that needs to be reformed or created. The technique also is applicable to inserting or deleting a prefix of a prefix.
摘要翻译：提供了一种技术来插入或删除具有直接表的Patricia树中的叶子，以及多个PSCB，其解码树中的叶子的图案的部分，而不关闭树的功能。具有图案的叶被识别为要插入或删除的叶。使用图案，树一次走一次，以确定要删除的叶的位置或叶被插入的位置。如果是删除操作，则要删除的叶被识别和删除，并且必要时修改任何相关的PSCB。如果是插入操作，则树第二次移动以插入叶，并在需要重新创建或创建的链中重新构建或创建任何PSCB。该技术也适用于插入或删除前缀的前缀。

20. 发明授权

US06963868B2 Multi-bit Patricia trees 失效
标题翻译：多比特Patricia树
公开(公告)号：US06963868B2
公开(公告)日：2005-11-08
申请号：US10448528
申请日：2003-05-30
申请人： Claude Basso , Jean L. Calvignac , Gordon T. Davis , Marco Heddes , Piyush C. Patel , Steven R. Perrin , Grayson W. Randall
发明人： Claude Basso , Jean L. Calvignac , Gordon T. Davis , Marco Heddes , Piyush C. Patel , Steven R. Perrin , Grayson W. Randall
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： H04L45/00 , H04L45/56 , H04L45/7457 , Y10S707/99933
摘要： A tree structure and method to organize routing information for processing messages within a network, each message being associated with a search key of “n” bits. The processing determines where to send the message next. The structure has a direct table (DT) of 2x entries for decoding the first “x” bits of the search key, and one or more pattern search control blocks (PSCB's), each having 2m entries for decoding subsequent groups of “m” bits. Each PSCB entry and DT entry includes a pointer to data associated with a specific route, if at this point a specific routing table entry is a potential match to the search key or a pointer to a subsequent PSCB if the end of a search trail is not identified. Each PSCB entry DT entry also indicates that the search has been resolved to the end of the search trail.
摘要翻译：一种用于组织用于处理网络内的消息的路由信息的树结构和方法，每个消息与“n”比特的搜索关键字相关联。该处理确定接下来发送消息的位置。该结构具有用于对搜索关键字的第一个“x”比特进行解码的2个“<”条目的直接表（DT），以及一个或多个模式搜索控制块（PSCB），每个具有2个

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式