公开(公告)号：US07653619B1

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

申请号：US11674487

申请日：2007-02-13

Applicant: Gary Depelteau ,  David W. Carr

Inventor： Gary Depelteau ,  David W. Carr

IPC: G06F17/30

CPC classification number: G06F17/30327

Abstract: A pipelined search engine device, such as a longest prefix match (LPM) search engine device, includes a hierarchical memory and a pipelined tree maintenance engine therein. The hierarchical memory is configured to store a b-tree of search prefixes (and possibly span prefix masks) at multiple levels therein. The pipelined tree maintenance engine, which is embedded within the search engine device, includes a plurality of node maintenance sub-engines that are distributed with the multiple levels of the hierarchical memory. The search engine device may also include pipeline control and search logic that is distributed with the multiple levels of the hierarchical memory.

Abstract translation: 诸如最长前缀匹配（LPM）搜索引擎设备的流水线搜索引擎设备在其中包括分层存储器和流水线树维护引擎。 分层存储器被配置为在其中的多个级别存储搜索前缀的b树（并且可能跨越前缀掩码）。 嵌入在搜索引擎设备内的流水线树维护引擎包括与分级存储器的多个级别分布的多个节点维护子引擎。 搜索引擎设备还可以包括与分层存储器的多个级别分布的流水线控制和搜索逻辑。

公开(公告)号：US06262985B1

公开(公告)日：2001-07-17

申请号：US09050129

申请日：1998-03-30

Applicant: Tony Huang ,  John Edward Vincent ,  James Leslie Watchorn ,  Paul Fong-Yan Hung ,  Osama Bahgat ,  Gary Depelteau ,  James McLaughlin

Inventor： Tony Huang ,  John Edward Vincent ,  James Leslie Watchorn ,  Paul Fong-Yan Hung ,  Osama Bahgat ,  Gary Depelteau ,  James McLaughlin

IPC: H04L1250

CPC classification number: H04L49/309 ,  H04L45/742 ,  H04Q11/0478

Abstract: Methods and apparatus are described for translating identifiers that are used by computers to reference various entities such as data structures, external objects, or connections in a telecommunications network, from a bulkier less manageable format to a smaller more manageable format. Such translations are carried out to reduce the needless processing and memory demands that are made of a localized set of components when the large identifiers the set receives from other components include fields that none of the members of the set need to access. The invention is centerd around a two-stage look-up method wherein an inputted external identifier is divided into two parts. The first part of the inputted external identifier is used as an address into a first look-up table that contains base-addresses of a second look-up table. The second part of the inputted external identifier is used as an offset-address into the second look-up table. The offset-address and the base-address are combined to access the second look-up table, which contains all the internal identifiers. The invention can be easily scaled to handle a larger range of external identifiers, and a larger number of internal identifiers. The invention operates at a fast and predictable speed. Use of the invention also leads to a significant savings in memory costs.

Abstract translation: 描述了用于翻译计算机使用的标识符的方法和装置，以引用各种实体，例如电信网络中的数据结构，外部对象或连接，从庞大的较不易管理的格式到更小的更易于管理的格式。 执行这样的翻译以减少当集合从其他组件接收到的大标识符包括集合中的任何成员都不需要访问的字段时，由本地化的组件集合形成的不必要的处理和存储器需求。 本发明围绕两阶段查找方法，其中输入的外部标识符被分成两部分。 输入的外部标识符的第一部分用作包含第二查找表的基地址的第一查找表中的地址。 输入的外部标识符的第二部分用作第二查找表中的偏移地址。 偏移地址和基地址被组合以访问包含所有内部标识符的第二查找表。 本发明可以容易地缩放以处理更大范围的外部标识符和更大数量的内部标识符。 本发明以快速且可预测的速度运行。 使用本发明还可显着节省存储器成本。