NETWORK PROCESSOR WITH SINGLE INTERFACE SUPPORTING TREE SEARCH ENGINE AND CAM
    51.
    发明申请
    NETWORK PROCESSOR WITH SINGLE INTERFACE SUPPORTING TREE SEARCH ENGINE AND CAM 失效
    网络处理器,具有单接口支持树搜索引擎和CAM

    公开(公告)号:US20060265363A1

    公开(公告)日:2006-11-23

    申请号:US11457952

    申请日:2006-07-17

    IPC分类号: G06F17/30

    摘要: A method and system for identifying a data structure associated with a packet of data. A processor internal to a packet processor may extract one or more fields in a packet header field of a received packet of data to generate a search key. The internal processor may then be configured to select which table, e.g., routing table, quality of service table, filter table, needs to be accessed using the search key in order to process the received packet of data. A determination may then be made by the internal processor as to whether a CAM or a hash table and a Patricia Tree are used to identify the data structure associated with the received packet of data. Based on table definitions in a register, the internal processor may make such a determination.

    摘要翻译: 一种用于识别与数据包相关联的数据结构的方法和系统。 分组处理器内部的处理器可以提取接收到的数据分组的分组报头字段中的一个或多个字段以生成搜索关键字。 然后可以将内部处理器配置为选择哪个表,例如路由表,服务质量表,过滤表,需要使用搜索关键字进行访问,以便处理接收的数据分组。 然后内部处理器可以确定CAM或散列表和Patricia Tree是否用于标识与所接收的数据分组相关联的数据结构。 根据寄存器中的表定义,内部处理器可以作出这样的确定。

    Data structure supporting session timer and variable aging function including self adjustable 2MSL
    55.
    发明申请
    Data structure supporting session timer and variable aging function including self adjustable 2MSL 审中-公开
    数据结构支持会话定时器和可变老化功能,包括自调节2MSL

    公开(公告)号:US20050050018A1

    公开(公告)日:2005-03-03

    申请号:US10654502

    申请日:2003-09-03

    IPC分类号: G06F17/30

    CPC分类号: G06F16/20

    摘要: Dynamic data search structures are described that are capable of handling large numbers of active entries and a high rate of additions and deletions of active entries while complying with 2MSL requirements and providing precise time-out capabilities. A free queue which is integrated with the timing loop of session entries provides available sessions for new entries in the search structure and removes obsolete sessions from the tree. Multiples of such timing loops can be used to maintain multiple timing intervals. One such timing loop may contain soft entries still attached to the search structure but which are eligible to be removed and to be reused to accommodate new sessions. A spare buffer pool is also included in the data structure to add and remove buffers to maintain delays.

    摘要翻译: 描述了能够处理大量活动条目的动态数据搜索结构,以及符合2MSL要求并提供精确超时能力的活动条目的增加和删除的高速率。 与会话条目的定时循环集成的空闲队列为搜索结构中的新条目提供可用会话,并从树中删除过时的会话。 这种定时循环的倍数可用于维持多个定时间隔。 一个这样的定时循环可以包含仍然附着到搜索结构但是有资格被移除并被重新使用以容纳新会话的软条目。 数据结构中还包括备用缓冲池,以添加和删除缓冲区以维持延迟。

    Fast routing and non-blocking switch which accomodates multicasting and
variable length packets
    56.
    发明授权
    Fast routing and non-blocking switch which accomodates multicasting and variable length packets 失效
    快速路由和非阻塞交换机,适应多播和可变长度的数据包

    公开(公告)号:US6144662A

    公开(公告)日:2000-11-07

    申请号:US100

    申请日:1998-04-13

    摘要: The invention relates to a switching device which transports data packets from input ports to selected output ports. The payload of the packets is stored in a storage means. A switching means is arranged which has more switch outputs than switch inputs and which switches sequentially between one switch input and several switch outputs while storing the payloads. Furthermore, the invention relates to a storing method which uses switching means to store payloads in a sequential order and to a switching apparatus comprising several switching devices. Furthermore, the invention relates to systems using the switching device as a scaleable module.

    摘要翻译: PCT No.PCT / IB96 / 00658 Sec。 371日期:1998年4月13日 102(e)1998年4月13日PCT PCT 1996年7月9日PCT公布。 出版物WO98 / 02013 日期1998年1月15日本发明涉及将数据分组从输入端口传送到选择的输出端口的切换装置。 分组的有效载荷被存储在存储装置中。 布置开关装置,其具有比开关输入更多的开关输出,并且在存储有效载荷的同时在一个开关输入和多个开关输出之间顺序切换。 此外,本发明涉及使用切换装置按顺序存储有效载荷的存储方法以及包括多个交换装置的交换装置。 此外,本发明涉及使用该开关装置作为可缩放模块的系统。

    High speed buffer management of share memory using linked lists and
plural buffer managers for processing multiple requests concurrently
    57.
    发明授权
    High speed buffer management of share memory using linked lists and plural buffer managers for processing multiple requests concurrently 失效
    使用链表对共享存储器进行高速缓冲管理,并且多个缓冲管理器同时处理多个请求

    公开(公告)号:US5432908A

    公开(公告)日:1995-07-11

    申请号:US313656

    申请日:1994-09-27

    CPC分类号: G06F5/06 G06F2205/064

    摘要: The present invention relates to the management of a large and fast memory. The memory is logically subdivided into several smaller parts called buffers. A buffer-control memory (11) having as many sections for buffer-control records as buffers exist is employed together with a buffer manager (12). The buffer manager (12) organizes and controls the buffers by keeping the corresponding buffer-control records in linked lists. A request manager (20), as pad of the buffer manager (12), does or does not grant the allocation of a buffer. A stack manager (21) controls the free buffers by keeping the buffer-control records in a stack (23.1), and a FIFO manager (22) keeps the buffer-control records of allocated buffers in FIFO linked lists (23.2-23.n). The stack and FIFO managers (20), (21) are parts of the buffer manager (12), too.

    摘要翻译: 本发明涉及大型和快速存储器的管理。 存储器在逻辑上细分为几个称为缓冲器的较小部件。 缓冲器管理器(12)与缓冲器控制存储器(11)一起使用,缓冲器控制存储器(11)具有与存储缓冲器控制记录一样多的部分。 缓冲管理器(12)通过将相应的缓冲器控制记录保持在链表中来组织和控制缓冲器。 作为缓冲器管理器(12)的焊盘的请求管理器(20)执行或不准许缓冲器的分配。 堆栈管理器(21)通过将缓冲器控制记录保持在堆栈(23.1)中来控制空闲缓冲器,并且FIFO管理器(22)将分配的缓冲器的缓冲器控制记录保持在FIFO链接列表中(23.2-23.n )。 栈和FIFO管理器(20),(21)也是缓冲管理器(12)的一部分。