中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

87 records (took 0.032 seconds)

    Optimizing search trees by increasing failure size parameter
    11.
    发明授权
    Optimizing search trees by increasing failure size parameter 失效
    通过增加失败大小参数来优化搜索树

    公开(公告)号：US07917486B1

    公开(公告)日：2011-03-29

    申请号：US11689429

    申请日：2007-03-21

    Applicant: Pankaj Gupta ,  Srinivasan Venkatachary

    Inventor： Pankaj Gupta ,  Srinivasan Venkatachary

    IPC: G06F7/00 ,  G06F17/30

    CPC classification number: G06F17/30985 ,  H04L63/1416 ,  Y10S707/99932 ,  Y10S707/99936 ,  Y10S707/99942

    Abstract: A search tree embodying a plurality of signatures to be compared with an input string of characters and including a number of branches of sequential states originating at a root node, wherein each state comprises a state entry including a failure transition and one or more success transitions, is optimized by selecting a failure size parameter indicating a minimum number of characters to be traversed on the failure transitions and selectively modifying the search tree to create a modified search tree for which all failure transitions to non-root states are characterized by the selected failure size parameter.

    Abstract translation: 体现多个签名的搜索树，其将与输入的字符串进行比较，并且包括源于根节点的顺序状态的多个分支，其中每个状态包括包括故障转移和一个或多个成功转换的状态输入， 通过选择故障大小参数来指示在故障转移上要穿过的最少字符数量并选择性地修改搜索树以创建修改的搜索树来优化，所述修改的搜索树对于所有失败转换到非根状态的特征在于所选择的故障大小 参数。

    Compact data structures for pipelined message forwarding lookups
    12.
    发明授权
    Compact data structures for pipelined message forwarding lookups 有权
    流水线消息转发查询的紧凑数据结构

    公开(公告)号：US06691124B2

    公开(公告)日：2004-02-10

    申请号：US09826556

    申请日：2001-04-04

    Applicant: Pankaj Gupta ,  Srinivasan Venkatachary

    Inventor： Pankaj Gupta ,  Srinivasan Venkatachary

    IPC: G06F1730

    CPC classification number: G06F17/30961 ,  Y10S707/99936 ,  Y10S707/99942 ,  Y10S707/99943

    Abstract: The invention provides a method and system for lookup (such as for example, lookup of message header information) that records information in a relatively large database in a relatively compact structure, while still providing for relatively rapid lookup and update. A relatively large but compact database includes a hybrid tree (or hybrid trie) structure, whereby information in denser portions of the database can be stored and retrieved from an identifiable leaf in the hybrid trie. The hybrid trie includes at least one leaf node marked to include a different data structure, whereby information in sparser portions of the database can be stored and retrieved from a more densely packed table. In a preferred embodiment, each hybrid trie node is marked as one of: a branch node, a leaf node, or a search node; each search node includes information for a sparser portion of the hybrid trie, packed into a structure capable of linear search in response to a set of packet header information (such as a destination IP address).

    Abstract translation: 本发明提供了一种用于在相对紧凑的结构中在相对大的数据库中记录信息的查找（例如，查找消息头信息）的方法和系统，同时仍然提供相对快速的查找和更新。 相对较大但紧凑的数据库包括混合树（或混合特里）结构，由此数据库的密集部分中的信息可以从混合特技中的可识别的叶存储和检索。 混合特技包括标记为包括不同数据结构的至少一个叶节点，由此可以从更密集的表格存储和检索数据库的较稀疏部分中的信息。 在优选实施例中，每个混合特里节点被标记为分支节点，叶节点或搜索节点之一; 每个搜索节点包括用于混合特技的稀疏部分的信息，其被打包成能够响应于一组分组报头信息（诸如目的地IP地址）进行线性搜索的结构。

    Network device, storage medium and methods for incrementally updating a forwarding database
    13.
    发明授权
    Network device, storage medium and methods for incrementally updating a forwarding database 失效
    网络设备，存储介质和用于递增更新转发数据库的方法

    公开(公告)号：US07571156B1

    公开(公告)日：2009-08-04

    申请号：US10809244

    申请日：2004-03-25

    Applicant: Pankaj Gupta ,  Srinivasan Venkatachary

    Inventor： Pankaj Gupta ,  Srinivasan Venkatachary

    IPC: G06F7/00 ,  G06F17/30

    CPC classification number: H04L45/00 ,  H04L45/02 ,  H04L45/7457 ,  Y10S707/99933 ,  Y10S707/99942 ,  Y10S707/99943

    Abstract: Network devices, storage mediums and methods for updating a memory structure in a data plane of the network device when route updates are received in the control plane of the network device. The methods described herein can be used to perform one of the following algorithms: a Basic Incremental Split-Merge (BISM) algorithm, a Lazy Incremental Split-Merge (LISM) algorithm, and a Down-support Split-Merge (DSM) algorithm. Each of the algorithms described herein may be used to incrementally update portions of a forwarding database stored within the memory structure, where the updated portions correspond to only those portions affected by the route updates.

    Abstract translation: 网络设备，存储介质和用于在网络设备的控制平面中接收到路由更新时更新网络设备的数据平面中的存储器结构的方法。 本文描述的方法可用于执行以下算法之一：基本增量分割合并（BISM）算法，延迟增量分割合并（LISM）算法和向下支持分割合并（DSM）算法。 本文描述的每个算法可以用于递增地更新存储在存储器结构内的转发数据库的部分，其中更新部分仅对应于受路由更新影响的那些部分。

    SYSTEM AND METHOD FOR EFFICIENTLY SEARCHING A FORWARDING DATABASE THAT IS SPLIT INTO A BOUNDED NUMBER OF SUB-DATABASES HAVING A BOUNDED SIZE
    14.
    发明申请
    SYSTEM AND METHOD FOR EFFICIENTLY SEARCHING A FORWARDING DATABASE THAT IS SPLIT INTO A BOUNDED NUMBER OF SUB-DATABASES HAVING A BOUNDED SIZE 失效
    用于有效搜索前向数据库的系统和方法，该数据库分割成具有边界大小的数据库的数量

    公开(公告)号：US20080275872A1

    公开(公告)日：2008-11-06

    申请号：US12171099

    申请日：2008-07-10

    Applicant: Srinivasan Venkatachary ,  Pankaj Gupta

    Inventor： Srinivasan Venkatachary ,  Pankaj Gupta

    IPC: G06F17/30

    CPC classification number: H04L45/00 ,  G06F17/30625 ,  H04L45/7457 ,  Y02D10/45 ,  Y10S707/99942 ,  Y10S707/99943

    Abstract: A method, apparatus, and storage medium product are provided for forming a forwarding database, and for using the formed database to more efficiently and quickly route packets of data across a computer network. The forwarding database is arranged into multiple sub-databases. Each sub-database is pointed to by a pointer within a pointer table. When performing a longest-match search of incoming addresses, a longest prefix matching algorithm can be used to find the longest match among specialized “spear prefixes” stored in the pointer table. After the longest spear prefixes are found, the pointer table will direct the next search within a sub-database pointed to by that spear prefix. Another longest-match search can be performed for database prefixes (or simply “prefixes”) within the sub-database selected by the pointer. Only the sub-database of interest will, therefore, be searched and all other sub-databases are not accessed. Using a precursor pointer and a sub-database of optimally bounded size and number ensures power consumption be confined only to the sub-database being accessed, and that higher speed lookup operations can be achieved since only the sub-database of interest is being searched.

    Abstract translation: 提供了一种形成转发数据库的方法，装置和存储介质产品，并且用于使用形成的数据库更有效地并且快速地通过计算机网络路由数据包。 转发数据库被安排成多个子数据库。 每个子数据库由指针表中的指针指向。 当对输入地址执行最长匹配搜索时，可以使用最长的前缀匹配算法来找到存储在指针表中的专用“矛前置”之间的最长匹配。 在找到最长的矛前缀之后，指针表将指示由该矛前缀指向的子数据库中的下一个搜索。 可以在由指针选择的子数据库中的数据库前缀（或简称“前缀”）执行另一最长匹配搜索。 因此，仅搜索感兴趣的子数据库，并且不会访问所有其他子数据库。 使用前导指针和具有最大有界大小和数量的子数据库，确保功耗仅限于正在访问的子数据库，并且可以实现更高速度的查找操作，因为仅搜索感兴趣的子数据库。

    System and method for efficiently searching a forwarding database that is split into a bounded number of sub-databases having a bounded size
    15.
    发明授权
    System and method for efficiently searching a forwarding database that is split into a bounded number of sub-databases having a bounded size 失效
    用于有效搜索转发数据库的系统和方法，该转发数据库被拆分为有界数量的具有有界大小的子数据库

    公开(公告)号：US07426518B2

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

    申请号：US10402887

    申请日：2003-03-28

    Applicant: Srinivasan Venkatachary ,  Pankaj Gupta

    Inventor： Srinivasan Venkatachary ,  Pankaj Gupta

    IPC: G06F17/30

    CPC classification number: H04L45/00 ,  G06F17/30625 ,  H04L45/7457 ,  Y02D10/45 ,  Y10S707/99942 ,  Y10S707/99943

    Abstract: A method, apparatus, and storage medium product are provided for forming a forwarding database, and for using the formed database to more efficiently and quickly route packets of data across a computer network. The forwarding database is arranged into multiple sub-databases. Each sub-database is pointed to by a pointer within a pointer table. When performing a longest-match search of incoming addresses, a longest prefix matching algorithm can be used to find the longest match among specialized “spear prefixes” stored in the pointer table. After the longest spear prefixes are found, the pointer table will direct the next search within a sub-database pointed to by that spear prefix. Another longest-match search can be performed for database prefixes (or simply “prefixes”) within the sub-database selected by the pointer. Only the sub-database of interest will, therefore, be searched and all other sub-databases are not accessed. Using a precursor pointer and a sub-database of optimally bounded size and number ensures power consumption be confined only to the sub-database being accessed, and that higher speed lookup operations can be achieved since only the sub-database of interest is being searched.

    Abstract translation: 提供了一种形成转发数据库的方法，装置和存储介质产品，并且用于使用形成的数据库更有效地并且快速地通过计算机网络路由数据包。 转发数据库被安排成多个子数据库。 每个子数据库由指针表中的指针指向。 当对输入地址执行最长匹配搜索时，可以使用最长的前缀匹配算法来找到存储在指针表中的专用“矛前置”之间的最长匹配。 在找到最长的矛前缀之后，指针表将指示由该矛前缀指向的子数据库中的下一个搜索。 可以在由指针选择的子数据库中的数据库前缀（或简称“前缀”）执行另一最长匹配搜索。 因此，仅搜索感兴趣的子数据库，并且不会访问所有其他子数据库。 使用前导指针和具有最大有界大小和数量的子数据库，确保功耗仅限于正在访问的子数据库，并且可以实现更高速度的查找操作，因为仅搜索感兴趣的子数据库。

    Memory management of striped pipelined data structures
    16.
    发明授权
    Memory management of striped pipelined data structures 失效
    条形流水线数据结构的内存管理

    公开(公告)号：US06636956B1

    公开(公告)日：2003-10-21

    申请号：US09900748

    申请日：2001-07-06

    Applicant: Srinivasan Venkatachary ,  Pankaj Gupta ,  Anand Rangarajan

    Inventor： Srinivasan Venkatachary ,  Pankaj Gupta ,  Anand Rangarajan

    IPC: G06F1200

    CPC classification number: G06F12/023

    Abstract: The invention provides a method and system for memory management, in which at least some individual nodes in a hybrid trie are striped across a set of pipelined memories. Memory management is performed for a hybrid trie including both branch-search nodes and leaf-search nodes and maintained in a sequence of pipelined memories. The method provides for insertion and removal of data elements within the hybrid trie and for storing at least some of the nodes in stripes across a sequence of the memories. Memory management is performed for the leaf-search nodes, by selecting stripes from the possible subsequences of those memories, that are suited to pipelined operations performed on the memories. In a preferred embodiment, an invariant condition is maintained for families of those stripes, in which exactly one cell block is labeled “sparse” and that cell block is used in techniques for allocation and de-allocation of entries.

    Abstract translation: 本发明提供了一种用于存储器管理的方法和系统，其中混合特技中的至少一些单独的节点跨越一组流水线存储器被条带化。 对包括分支搜索节点和叶搜索节点的混合特技进行存储器管理，并保持在流水线存储器的序列中。 该方法提供插入和移除混合特技内的数据元素，并且用于存储跨越存储器序列的条带中的至少一些节点。 通过从那些存储器的可能子序列中选择适合于对存储器执行的流水线操作的条带来对叶搜索节点执行存储器管理。 在优选实施例中，为这些条带的系列保持不变条件，其中正好一个信元块被标记为“稀疏”，并且该信元块用于条目的分配和解除分配的技术。

    Signal quality estimation and control
    17.
    发明授权
    Signal quality estimation and control 有权
    信号质量估算与控制

    公开(公告)号：US09172483B2

    公开(公告)日：2015-10-27

    申请号：US13899868

    申请日：2013-05-22

    Applicant: Pankaj Gupta ,  Sriram Murali ,  Jaiganesh Balakrishnan ,  Sanjay Vishwakarma

    Inventor： Pankaj Gupta ,  Sriram Murali ,  Jaiganesh Balakrishnan ,  Sanjay Vishwakarma

    IPC: H04B17/00 ,  H04H60/58 ,  H04B1/16 ,  H04H40/45

    CPC classification number: H04H60/58 ,  H04B1/1646 ,  H04H40/45 ,  H04H40/72 ,  H04H40/81

    Abstract: Several circuits and methods implemented to perform signal quality estimation and control are disclosed. In an embodiment, a method of signal quality estimation includes generating a demodulated signal associated with a radio signal. Information associated with a quality of the demodulated signal is accessed. Further, a value of radio frequency signal-to-noise ratio (RF-SNR) for the radio signal based on the information is estimated. Estimating the value of RF-SNR facilitates in signal quality estimation of the radio signal and control of the demodulated signal.

    Abstract translation: 公开了执行信号质量估计和控制的几种电路和方法。 在一个实施例中，信号质量估计的方法包括产生与无线电信号相关联的解调信号。 访问与解调信号的质量相关的信息。 此外，估计基于该信息的无线电信号的射频信噪比（RF-SNR）值。 估计RF-SNR的值有助于无线电信号的信号质量估计和解调信号的控制。

Patent Agency Ranking