利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

57 条记录 (耗时 0.037 秒)

    Method of inserting and deleting leaves in tree table structures
    1.
    发明授权
    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。 该技术也适用于插入或删除前缀的前缀。

    Multi-bit Patricia trees
    2.
    发明授权
    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个

    Deleting leaves in tree table structures
    5.
    发明授权
    Deleting leaves in tree table structures 失效
    删除树表结构中的树叶

    公开(公告)号：US08135752B2

    公开(公告)日：2012-03-13

    申请号：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分类号： G06F7/00 ,  G06F17/00 ,  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 leaf keys and pattern search control blocks containing a prefix and either an end-of-trail leaf or a pointer to another of the pattern search control blocks, by placing each of the prefixes in a tree prefix table; searching for a key in the tree; searching for the key in the prefix table if the tree searching does not find the key in the tree; confirming that the key is deleted if the key is not found in the prefix table; deleting the key from one of the pattern search control blocks; and collapsing the patricia tree by eliminating the left most pattern search control block from the patricia tree if the patricia tree searching finds the key.

    摘要翻译： 提供的技术和制品包括计算机可读程序，当在计算机上执行计算机可读程序时，使计算机从具有叶键的图案搜索控制块和包含前缀的叶片的叶片中删除叶 或指向另一个模式搜索控制块的指针，通过将每个前缀放置在树前缀表中; 在树中搜索一个键; 如果树搜索没有在树中找到密钥，则在前缀表中搜索密钥; 如果在前缀表中没有找到密钥，则确认该密钥被删除; 从模式搜索控制块之一删除密钥; 并且如果所述爱好者树搜索找到所述密钥，则通过从所述爱好树中消除所述最左图案搜索控制块来折叠所述爱好者树。

    SYSTEM FOR MANAGING MULTI-FIELD CLASSIFICATION RULES RELATING TO INGRESS CONTEXTS AND EGRESS CONTEXTS
    6.
    发明申请
    SYSTEM FOR MANAGING MULTI-FIELD CLASSIFICATION RULES RELATING TO INGRESS CONTEXTS AND EGRESS CONTEXTS 失效
    用于管理与生态系统和排气系统有关的多领域分类规则的系统

    公开(公告)号：US20080249973A1

    公开(公告)日：2008-10-09

    申请号：US12143641

    申请日：2008-06-20

    申请人： Everett A. Corl ,  Gordon T. Davis ,  Marco Heddes ,  Piyush C. Patel ,  Ravinder K. Sabhikhi

    发明人： Everett A. Corl ,  Gordon T. Davis ,  Marco Heddes ,  Piyush C. Patel ,  Ravinder K. Sabhikhi

    IPC分类号： G06N5/02

    CPC分类号： G06N99/005

    摘要： The present invention relates to a system for managing a plurality of multi-field classification rules. The system provides a first table that includes a plurality of entries corresponding to a plurality of rules relating to an ingress context and a second table that includes a plurality of entries corresponding to a plurality of rules relating to an egress context. The system also includes a network processor for classifying packets of information, wherein the network processor is programmed to utilize the first table and the second table to identify any rules relating to the ingress context and any one rules relating to the egress context that match a search key.

    摘要翻译： 本发明涉及一种用于管理多个多场分类规则的系统。 该系统提供第一表，其包括对应于与入口上下文相关的多个规则的多个条目，以及第二表，其包括对应于与出口上下文相关的多个规则的多个条目。 该系统还包括用于对信息包进行分类的网络处理器，其中网络处理器被编程为利用第一表和第二表来识别与入口上下文有关的任何规则以及与搜索匹配的出口上下文相关的任何规则 键。

    Method for managing multi-field classification rules relating to ingress
    7.
    发明授权
    Method for managing multi-field classification rules relating to ingress 失效
    管理与入口有关的多领域分类规则的方法

    公开(公告)号：US07412431B2

    公开(公告)日：2008-08-12

    申请号：US10832958

    申请日：2004-04-27

    申请人： Everett A. Corl, Jr. ,  Gordon T. Davis ,  Marco Heddes ,  Piyush C. Patel ,  Ravinder K. Sabhikhi

    发明人： Everett A. Corl, Jr. ,  Gordon T. Davis ,  Marco Heddes ,  Piyush C. Patel ,  Ravinder K. Sabhikhi

    IPC分类号： G06F17/00 ,  G06N5/02

    CPC分类号： G06N99/005

    摘要： The present invention relates to a method for managing a plurality of multi-field classification rules. The method includes providing a first table that includes a plurality of entries corresponding to a plurality of rules relating to an ingress context and providing a second table that includes a plurality of entries corresponding to a plurality of rules relating to an egress context. The method also includes utilizing the first table and the second table to identify any rules relating to the ingress context and any rules relating to the egress context that match a search key.

    摘要翻译： 本发明涉及一种用于管理多个多场分类规则的方法。 该方法包括提供第一表格，该第一表格包括对应于与入口上下文有关的多个规则的多个条目，并提供第二表格，该第二表格包括对应于与出口上下文有关的多个规则的多个条目。 该方法还包括利用第一表和第二表来识别与入口上下文有关的任何规则以及与搜索关键字匹配的出口上下文相关的任何规则。

    SYSTEM FOR DEFINING DATA MAPPINGS BETWEEN DATA STRUCTURES
    8.
    发明申请
    SYSTEM FOR DEFINING DATA MAPPINGS BETWEEN DATA STRUCTURES 失效
    用于定义数据结构之间数据映射的系统

    公开(公告)号：US20080162525A1

    公开(公告)日：2008-07-03

    申请号：US12048667

    申请日：2008-03-14

    申请人： Everett A. CORL ,  Gordon T. Davis ,  Marco Heddes ,  Piyush C. Patel ,  Ravinder K. Sabhikhi

    发明人： Everett A. CORL ,  Gordon T. Davis ,  Marco Heddes ,  Piyush C. Patel ,  Ravinder K. Sabhikhi

    IPC分类号： G06F17/30

    CPC分类号： H03M7/30 ,  Y10S707/99942

    摘要： Method for compressing search tree structures used in rule classification is provided. The method includes classifying packets based on filter rules, compressing a tree structure comprising multiple levels of single bit test nodes and leaf nodes, storing the compressed tree structure in a first memory structure of a storage such that the multiple levels of single bit test nodes and leaf nodes can be accessed from the first memory structure through a single memory access of the storage, collecting single bit test nodes of the tree structure that are in a lowest level of the tree structure, storing only the collected single bit test nodes within a second memory structure of the storage that is contiguous to the first memory structure, collecting leaf nodes of the tree structure, and storing only the collected leaf nodes within a third memory structure of the storage that is contiguous to second memory structure.

    摘要翻译： 提供了规则分类中使用的搜索树结构的压缩方法。 该方法包括基于过滤器规则对分组进行分类，压缩包括多个单位测试节点和叶节点的树结构，将压缩的树结构存储在存储器的第一存储器结构中，使得多个单位测试节点和 可以通过存储器的单个存储器访问从第一存储器结构访问叶节点，收集处于树结构的最低级别的树结构的单位测试节点，仅在第二存储器结构中存储所收集的单个位测试节点 与第一存储器结构相邻的存储器的存储器结构，收集树结构的叶节点，以及仅存储所收集的叶节点在与第二存储器结构相邻的存储器的第三存储器结构内。

    System for defining data mappings between data structures
    10.
    发明授权
    System for defining data mappings between data structures 失效
    用于定义数据结构之间数据映射的系统

    公开(公告)号：US08005869B2

    公开(公告)日：2011-08-23

    申请号：US12048667

    申请日：2008-03-14

    申请人： Everett A. Corl, Jr. ,  Gordon T. Davis ,  Marco Heddes ,  Piyush C. Patel ,  Ravinder K. Sabhikhi

    发明人： Everett A. Corl, Jr. ,  Gordon T. Davis ,  Marco Heddes ,  Piyush C. Patel ,  Ravinder K. Sabhikhi

    IPC分类号： G06F7/00

    CPC分类号： H03M7/30 ,  Y10S707/99942

    摘要： Method for compressing search tree structures used in rule classification is provided. The method includes classifying packets based on filter rules, compressing a tree structure comprising multiple levels of single bit test nodes and leaf nodes, storing the compressed tree structure in a first memory structure of a storage such that the multiple levels of single bit test nodes and leaf nodes can be accessed from the first memory structure through a single memory access of the storage, collecting single bit test nodes of the tree structure that are in a lowest level of the tree structure, storing only the collected single bit test nodes within a second memory structure of the storage that is contiguous to the first memory structure, collecting leaf nodes of the tree structure, and storing only the collected leaf nodes within a third memory structure of the storage that is contiguous to second memory structure.

    摘要翻译： 提供了规则分类中使用的搜索树结构的压缩方法。 该方法包括基于过滤器规则对分组进行分类，压缩包括多个单位测试节点和叶节点的树结构，将压缩的树结构存储在存储器的第一存储器结构中，使得多个单位测试节点和 可以通过存储器的单个存储器访问从第一存储器结构访问叶节点，收集处于树结构的最低级别的树结构的单位测试节点，仅在第二存储器结构中存储所收集的单位测试节点 与第一存储器结构相邻的存储器的存储器结构，收集树结构的叶节点，以及仅存储所收集的叶节点在与第二存储器结构相邻的存储器的第三存储器结构内。