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

11. 发明授权

US07116664B2 Lookups by collisionless direct tables and CAMs 失效
标题翻译：通过无碰撞直接表和CAM进行查找
公开(公告)号：US07116664B2
公开(公告)日：2006-10-03
申请号：US10144610
申请日：2002-05-13
申请人： Gordon Taylor Davis , Andreas Guenther Herkersdorf , Clark Debs Jeffries , Mark Anthony Rinaldi
发明人： Gordon Taylor Davis , Andreas Guenther Herkersdorf , Clark Debs Jeffries , Mark Anthony Rinaldi
IPC分类号： G06F12/00 , H04L12/56
CPC分类号： H04L49/3009 , H04L45/745 , H04L45/7453 , H04L49/351
摘要： A structure and technique for preventing collisions using a hash table in conjunction with a CAM to identify and prevent collisions of binary keys. A portion of the hash value of a binary key, which does not collide with a portion of the hash value of any other reference binary key, is used as an entry in the hash table. If two or more binary keys have identical values of the portions of the hash values, each of these binary keys are stored in their entirety, in the CAM. The key in the CAM provides a pointer to a data structure where the action associated with that binary key is stored. If the binary key is not found in the CAM, the binary key is hashed, and a specific entry in the hash table is selected using a portion of this hash value.
摘要翻译：一种用于使用散列表与CAM结合来防止冲突的结构和技术，以识别和防止二进制键的冲突。不与任何其他参考二进制密钥的散列值的一部分相冲突的二进制密钥的散列值的一部分被用作散列表中的条目。如果两个或更多个二进制密钥具有相同的哈希值部分的值，则这些二进制密钥中的每一个都将全部存储在CAM中。 CAM中的关键字提供了指向数据结构的指针，其中存储与该二进制密钥相关联的动作。如果在CAM中没有找到二进制密钥，则二进制密钥被散列，并且使用该哈希值的一部分来选择散列表中的特定条目。

12. 发明授权

US08130650B2 Retro flow control for arriving traffic in computer networks 失效
标题翻译：计算机网络到达流量的复杂流量控制
公开(公告)号：US08130650B2
公开(公告)日：2012-03-06
申请号：US12174999
申请日：2008-07-17
申请人： James Johnson Allen, Jr. , Brian Mitchell Bass , Gordon Taylor Davis , Clark Debs Jeffries , Jitesh Ramachandran Nair , Ravinder Kumar Sabhikhi , Michael Steven Siegel , Rama Mohan Yedavalli
发明人： James Johnson Allen, Jr. , Brian Mitchell Bass , Gordon Taylor Davis , Clark Debs Jeffries , Jitesh Ramachandran Nair , Ravinder Kumar Sabhikhi , Michael Steven Siegel , Rama Mohan Yedavalli
IPC分类号： H04L12/26
CPC分类号： H04L47/32 , H04L47/12 , H04L47/24 , H04L47/30 , H04L49/90
摘要： The decision within a packet processing device to transmit a newly arriving packet into a queue to await further processing or to discard the same packet is made by a flow control method and system. The flow control is updated with a constant period determined by storage and flow rate limits. The update includes comparing current queue occupancy to a threshold. The outcome of the update is adjustment up or down of the transmit probability value. The value is stored for the subsequent period of flow control and packets arriving during that period are subject to a transmit or discard decision that uses that value.
摘要翻译：通过流控制方法和系统，在分组处理设备内决定将新到达的分组发送到队列中等待进一步处理或丢弃相同的分组。流量控制以由存储和流量限制确定的恒定周期进行更新。该更新包括将当前队列占用率与阈值进行比较。更新的结果是传输概率值的上调或下调。该值存储在随后的流量控制周期中，并且在该时间段期间到达的分组经受使用该值的发送或丢弃决定。

13. 发明授权

US08081632B2 Lookups by collisionless direct tables and CAMS 有权
标题翻译：通过无碰撞直接表和CAMS查找
公开(公告)号：US08081632B2
公开(公告)日：2011-12-20
申请号：US11962558
申请日：2007-12-21
申请人： Gordon Taylor Davis , Andreas Guenther Herkersdorf , Clark Debs Jeffries , Mark Anthony Rinaldi
发明人： Gordon Taylor Davis , Andreas Guenther Herkersdorf , Clark Debs Jeffries , Mark Anthony Rinaldi
IPC分类号： G06F12/00 , H04L12/56
CPC分类号： H04L49/3009 , H04L45/745 , H04L45/7453 , H04L49/351
摘要： Computers are caused to provide a hash table wherein each entry is associated with a binary key and indexed by a selected portion of a hash value of the associated key, and points to a data structure location for storing non-selected portions of, or the entire hash value of, the binary key, and action data corresponding to the value of the binary key. Content addressable memory entries store a binary key, or a value unique to it, and an association to a corresponding action. Pointers to the data structure use selected portions of binary key hash values as an index when not selected portions of hash values of other binary keys, and associations are established between CAM entry and associated data structure locations when selected portions of the hash values of the binary keys are the same as selected portions of hash values of one or more other binary keys.
摘要翻译：导致计算机提供散列表，其中每个条目与二进制密钥相关联并由相关联的密钥的哈希值的选定部分索引，并且指向用于存储未选择的部分或全部的数据结构位置哈希值，二进制密钥和对应于二进制密钥值的动作数据。内容可寻址存储器条目存储二进制密钥或其唯一值，以及与相应操作的关联。指向数据结构的指针使用二进制密钥散列值的选定部分作为索引，当未选择其他二进制密钥的散列值部分时，以及在CAM条目和相关联的数据结构位置之间建立关联时，二进制对象的哈希值的选定部分键与一个或多个其他二进制键的哈希值的选定部分相同。

14. 发明授权

US06940864B2 Network access traffic sorter 失效
标题翻译：网络访问流量分拣机
公开(公告)号：US06940864B2
公开(公告)日：2005-09-06
申请号：US09906352
申请日：2001-07-16
申请人： Youssef Abdelilah , Gordon Taylor Davis , Jeffrey Haskell Derby , Dongming Hwang , Clark Debs Jeffries , Malcolm Scott Ware , Hua Ye
发明人： Youssef Abdelilah , Gordon Taylor Davis , Jeffrey Haskell Derby , Dongming Hwang , Clark Debs Jeffries , Malcolm Scott Ware , Hua Ye
IPC分类号： H04L12/56 , H04L29/06 , H04Q12/28
CPC分类号： H04L65/605 , H04L29/06027 , H04L47/2441 , H04L47/2458 , H04L47/365 , H04L47/50 , H04L65/80 , H04L69/22
摘要： Packetized voice, video, and data traffic (data frames) are received in a communication traffic sorter. The data frames have a dispatch priority corresponding to their transmission characteristics (flow) and a quality of service parameters. The communication traffic sorter analyzes information in data packets within each data frame and determines an optimum flow for the data frames. A data frame is assigned to a selected queue based on an analysis of the information in its data packets. A data frame may also be assigned to a queue based on a prior analysis of a data frame with like transmission characteristics. Results of analysis are stored and indexed to facilitate processing of subsequent data frames. The network access sorter has circuits to un-pack and re-pack the data frame, when called for, to allow user transmitted data to be processed to create a modified data frame. The data frame may then be dispatched with a second dispatch priority on a bus for distribution to end users where previously assigned quality of service is maintained or exceeded.
摘要翻译：分组化语音，视频和数据业务（数据帧）在通信流量分类器中被接收。数据帧具有对应于其传输特性（流）和服务质量参数的调度优先级。通信流量分类器分析每个数据帧内的数据分组中的信息，并确定数据帧的最佳流。基于对其数据分组中的信息的分析，将数据帧分配给所选择的队列。基于具有相似传输特性的数据帧的先前分析，也可以将数据帧分配给队列。分析结果存储和索引，以便于后续数据帧的处理。网络访问分拣机具有用于在被要求时解除数据帧的打包和重新打包的电路，以允许用户传送的数据被处理以创建经修改的数据帧。然后可以在总线上以第二调度优先级调度数据帧，以便分发给维护或超过先前分配的服务质量的最终用户。

15. 发明授权

US06925503B2 Method and system for performing a longest prefix match search 失效
标题翻译：用于执行最长前缀匹配搜索的方法和系统
公开(公告)号：US06925503B2
公开(公告)日：2005-08-02
申请号：US09916766
申请日：2001-07-27
申请人： Gordon Taylor Davis , Clark Debs Jeffries , Grayson Warren Randall , Sonia Kiang Rovner
发明人： Gordon Taylor Davis , Clark Debs Jeffries , Grayson Warren Randall , Sonia Kiang Rovner
IPC分类号： G06F7/00 , G06F15/173 , H04L12/56
CPC分类号： H04L45/54 , H04L45/04
摘要： A method and system for finding a longest prefix match for a key in a computer network is disclosed. The method and system include providing a main engine and providing an auxiliary engine. The main engine is for storing a first plurality of addresses and for searching the first plurality of addresses for the longest prefix match for the key. None of the first plurality of addresses is a prefix for another address of the first plurality of addresses. The auxiliary engine is for storing and searching a second plurality of addresses. A first address of the second plurality of addresses is capable of including the prefix for a second address of the first plurality of addresses or for a third address for the second plurality of addresses. None of the first plurality of addresses is the prefix for any of the second plurality of addresses. Each of the second plurality of addresses is distinct from each of the first plurality of addresses.
摘要翻译：公开了一种用于为计算机网络中的密钥找到最长前缀匹配的方法和系统。该方法和系统包括提供主机并提供辅助发动机。主引擎用于存储第一多个地址，并用于搜索第一多个地址以获得密钥的最长前缀匹配。第一多个地址中没有一个是第一多个地址的另一地址的前缀。辅助引擎用于存储和搜索第二多个地址。第二多个地址的第一地址能够包括第一多个地址的第二地址的前缀或第二多个地址的第三地址。第一多个地址中没有一个是第二多个地址中的任一个的前缀。第二多个地址中的每一个与第一多个地址中的每一个不同。

16. 发明授权

US06529897B1 Method and system for testing filter rules using caching and a tree structure 失效
标题翻译：使用缓存和树结构测试过滤规则的方法和系统
公开(公告)号：US06529897B1
公开(公告)日：2003-03-04
申请号：US09540500
申请日：2000-03-31
申请人： Everett Arthur Corl, Jr. , Gordon Taylor Davis , Clark Debs Jeffries , Malcolm Scott Ware
发明人： Everett Arthur Corl, Jr. , Gordon Taylor Davis , Clark Debs Jeffries , Malcolm Scott Ware
IPC分类号： G06F1730
CPC分类号： H04L47/10 , H04L47/24 , H04L47/2425 , H04L63/0227 , H04L63/0263 , H04Q11/04 , H04Q2213/13103 , H04Q2213/13343 , Y10S707/99932
摘要： A method and system for testing a plurality of filter rules in a computer system is disclosed. The plurality of filter rules are used with a key that is capable of matching at least one of the plurality of filter rules. The at least one filter rule corresponds to at least one action. The computer system has a cache including a plurality of bins and a decision tree. The method and system include searching a plurality of stored keys in the cache for the key. Preferably, this search of the cache for the key includes determining whether a stored key exactly matches the key. A plurality of stored filter rules corresponds to the plurality of stored keys. A plurality of stored actions corresponds to the plurality of stored filter rules. The cache stores each of the plurality of stored keys and at least one stored action in each bin of a portion of the bins. The method and system also include obtaining the at least one action from the cache if the key is found in plurality of stored keys and otherwise obtaining the at least one action using the decision tree. Preferably, searches of the decision tree and cache start simultaneously. The decision tree search is terminated if the key is found in the cache. The cache is written to if the at least one action is obtained using the decision tree, but preferably only if the at least one filter rule has a priority of one.
摘要翻译：公开了一种用于测试计算机系统中的多个过滤规则的方法和系统。多个滤波器规则与能够匹配多个滤波器规则中的至少一个的密钥一起使用。至少一个过滤规则对应于至少一个动作。计算机系统具有包括多个箱体和决策树的高速缓存器。该方法和系统包括在密钥的高速缓存中搜索多个存储的密钥。优选地，对于密钥的高速缓存的搜索包括确定存储的密钥是否与密钥完全匹配。多个存储的过滤规则对应于多个存储的密钥。多个存储的动作对应于多个存储的过滤器规则。高速缓存存储多个存储的密钥中的每一个以及至少一个存储的动作在仓的一部分的每个仓中。所述方法和系统还包括如果在多个存储的密钥中找到密钥并且否则使用所述决策树获得所述至少一个动作，则从所述高速缓存获得所述至少一个动作。优选地，决策树和高速缓存的搜索同时开始。如果在缓存中找到密钥，则决定树搜索将被终止。如果使用决策树获得至少一个动作，则优先写入高速缓存，但是优选地仅当所述至少一个过滤器规则具有优先级为1时。

17. 发明申请

US20100241746A1 Method, Program and System for Efficiently Hashing Packet Keys into a Firewall Connection Table 有权
标题翻译：方法，程序和系统有效地将数据包密钥散列到防火墙连接表中
公开(公告)号：US20100241746A1
公开(公告)日：2010-09-23
申请号：US12796363
申请日：2010-06-08
申请人： Everett Arthur Corl, JR. , Gordon Taylor Davis , Clark Debs Jeffries , Steven Richard Perrin , Hiroshi Takada , Victoria Sue Thio
发明人： Everett Arthur Corl, JR. , Gordon Taylor Davis , Clark Debs Jeffries , Steven Richard Perrin , Hiroshi Takada , Victoria Sue Thio
IPC分类号： G06F15/173
CPC分类号： H04L29/12009 , H04L29/12462 , H04L29/12481 , H04L45/745 , H04L61/255 , H04L61/2557
摘要： A method for increasing the capacity of a connection table in a firewall accelerator by means of mapping packets in one session with some common security actions into one table entry. For each of five Network Address Translation (NAT) configurations, a hash function is specified. The hash function takes into account which of four possible arrival types a packet at a firewall accelerator may have. When different arrival types of packets in the same session are processed, two or more arrival types may have the same hash value.
摘要翻译：一种通过将一个会话中的分组映射到一个表条目中的一些常见安全措施来增加防火墙加速器中连接表的容量的方法。对于五种网络地址转换（NAT）配置中的每一种，都指定了一个散列函数。散列函数考虑了防火墙加速器可能具有的四个可能的到达类型中的哪一个。当处理相同会话中的不同到达类型的分组时，两个或多个到达类型可以具有相同的哈希值。

18. 发明授权

US07769858B2 Method for efficiently hashing packet keys into a firewall connection table 失效
标题翻译：将数据包密钥高效地散列到防火墙连接表中的方法
公开(公告)号：US07769858B2
公开(公告)日：2010-08-03
申请号：US11063950
申请日：2005-02-23
申请人： Everett Arthur Corl, Jr. , Gordon Taylor Davis , Clark Debs Jeffries , Steven Richard Perrin , Hiroshi Takada , Victoria Sue Thio
发明人： Everett Arthur Corl, Jr. , Gordon Taylor Davis , Clark Debs Jeffries , Steven Richard Perrin , Hiroshi Takada , Victoria Sue Thio
IPC分类号： G06F15/173
CPC分类号： H04L29/12009 , H04L29/12462 , H04L29/12481 , H04L45/745 , H04L61/255 , H04L61/2557
摘要： A method for increasing the capacity of a connection table in a firewall accelerator by means of mapping packets in one session with some common security actions into one table entry. For each of five Network Address Translation (NAT) configurations, a hash function is specified. The hash function takes into account which of four possible arrival types a packet at a firewall accelerator may have. When different arrival types of packets in the same session are processed, two or more arrival types may have the same hash value.
摘要翻译：一种通过将一个会话中的分组映射到一个表条目中的一些常见安全措施来增加防火墙加速器中连接表的容量的方法。对于五种网络地址转换（NAT）配置中的每一种，都指定了一个散列函数。散列函数考虑了防火墙加速器可能具有的四个可能的到达类型中的哪一个。当处理相同会话中的不同到达类型的分组时，两个或多个到达类型可以具有相同的哈希值。

19. 发明授权

US07403527B2 Lookups by collisionless direct tables and cams 有权
标题翻译：通过无碰撞直接表和凸轮进行查找
公开(公告)号：US07403527B2
公开(公告)日：2008-07-22
申请号：US11867963
申请日：2007-10-05
申请人： Gordon Taylor Davis , Andreas Guenther Herkersdorf , Clark Debs Jeffries , Mark Anthony Rinaldi
发明人： Gordon Taylor Davis , Andreas Guenther Herkersdorf , Clark Debs Jeffries , Mark Anthony Rinaldi
IPC分类号： G06F12/00 , H04L12/56
CPC分类号： H04L49/3009 , H04L45/745 , H04L45/7453 , H04L49/351
摘要： A structure and technique for preventing collisions using a hash table in conjunction with a CAM to identify and prevent collision of binary keys. A portion of the hash value of a binary key, which does not collide with a portion of the hash value of any other reference binary key, is used as an entry in the hash table. If two or more binary keys have identical values of the portions of the hash values, each of these binary keys are stored in their entirety, in the CAM. The key in the CAM provides a pointer to a data structure where the action associated with that binary key is stored. If the binary key is not found in the CAM, the binary key is hashed, and a specific entry in the hash table is selected using a portion of this hash value.
摘要翻译：一种用于使用散列表与CAM结合来防止冲突的结构和技术，以识别和防止二进制密钥的冲突。不与任何其他参考二进制密钥的散列值的一部分相冲突的二进制密钥的散列值的一部分被用作散列表中的条目。如果两个或更多个二进制密钥具有相同的哈希值部分的值，则这些二进制密钥中的每一个都将全部存储在CAM中。 CAM中的关键字提供了指向数据结构的指针，其中存储与该二进制密钥相关联的动作。如果在CAM中没有找到二进制密钥，则二进制密钥被散列，并且使用该哈希值的一部分来选择散列表中的特定条目。

20. 发明授权

US07349397B2 Lookups by collisionless direct tables and CAMS 有权
标题翻译：通过无碰撞直接表和CAMS查找
公开(公告)号：US07349397B2
公开(公告)日：2008-03-25
申请号：US11462071
申请日：2006-08-03
申请人： Gordon Taylor Davis , Andreas Guenther Herkersdorf , Clark Debs Jeffries , Mark Anthony Rinaldi
发明人： Gordon Taylor Davis , Andreas Guenther Herkersdorf , Clark Debs Jeffries , Mark Anthony Rinaldi
IPC分类号： G06F12/00 , H04L12/56
CPC分类号： H04L49/3009 , H04L45/745 , H04L45/7453 , H04L49/351
摘要： A structure and technique for preventing collisions using a hash table in conjunction with a CAM to identify and prevent collisions of binary keys. A portion of the hash value of a binary key, which does not collide with a portion of the hash value of any other reference binary key, is used as an entry in the hash table. If two or more binary keys have identical values of the portions of the hash values, each of these binary keys are stored in their entirety, in the CAM. The key in the CAM provides a pointer to a data structure where the action associated with that binary key is stored. If the binary key is not found in the CAM, the binary key is hashed, and a specific entry in the hash table is selected using a portion of this hash value.
摘要翻译：一种用于使用散列表与CAM结合来防止冲突的结构和技术，以识别和防止二进制键的冲突。不与任何其他参考二进制密钥的散列值的一部分相冲突的二进制密钥的散列值的一部分被用作散列表中的条目。如果两个或更多个二进制密钥具有相同的哈希值部分的值，则这些二进制密钥中的每一个都将全部存储在CAM中。 CAM中的关键字提供了指向数据结构的指针，其中存储与该二进制密钥相关联的动作。如果在CAM中没有找到二进制密钥，则二进制密钥被散列，并且使用该哈希值的一部分来选择散列表中的特定条目。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式