利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

27 条记录 (耗时 0.029 秒)

    Longest prefix match (LPM) algorithm implementation for a network processor
    1.
    发明申请
    Longest prefix match (LPM) algorithm implementation for a network processor 失效
    用于网络处理器的最长前缀匹配（LPM）算法实现

    公开(公告)号：US20050144553A1

    公开(公告)日：2005-06-30

    申请号：US11045634

    申请日：2005-01-28

    申请人： Brian Bass ,  Jean Calvignac ,  Marco Heddes ,  Antonios Maragkos ,  Piyush Patel ,  Michael Siegel ,  Fabrice Verplanken

    发明人： Brian Bass ,  Jean Calvignac ,  Marco Heddes ,  Antonios Maragkos ,  Piyush Patel ,  Michael Siegel ,  Fabrice Verplanken

    IPC分类号： G06F17/30 ,  G06F17/00

    CPC分类号： G06F17/30985 ,  H04L45/7457 ,  Y10S707/99931 ,  Y10S707/99933 ,  Y10S707/99936 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99945

    摘要： Novel data structures, methods and apparatus for finding the longest prefix match search when searching tables with variable length patterns or prefixes. To find the exact match or the best matching prefix, patterns have to be compared a bit at a time until the exact or first: match is found. This requires “n” number of comparisons or memory accesses to identify the closest matching pattern. The trees are built in such a way that the matching result is guaranteed to be a best match, whether it is an exact match or a longest prefix match. Using the trail of all the birds and associated prefix lengths enables determination of the correct prefix result from the trail. By construction, the search tree provides the best matching prefix at or after the first compare during walking of the trail or tree.

    摘要翻译： 当搜索具有可变长度模式或前缀的表时，用于查找最长前缀的新型数据结构，方法和装置匹配搜索。 要找到完全匹配或最佳匹配前缀，模式必须一次比较一下，直到找到完全匹配或第一个匹配。 这需要“n”个比较或存储器访问来识别最接近的匹配模式。 树的建立方式使得匹配结果保证是最佳匹配，无论是完全匹配还是最长匹配前缀。 使用所有鸟的踪迹和相关的前缀长度可以确定路线中正确的前缀结果。 通过构建，搜索树在步道或树的步行期间在第一次比较之前或之后提供最佳的匹配前缀。

    Full match (FM) search algorithm implementation for a network processor
    2.
    发明申请
    Full match (FM) search algorithm implementation for a network processor 失效
    网络处理器的完全匹配（FM）搜索算法实现

    公开(公告)号：US20050076010A1

    公开(公告)日：2005-04-07

    申请号：US10650327

    申请日：2003-08-28

    申请人： Brian Bass ,  Jean Calvignac ,  Marco Heddes ,  Antonios Maragkos ,  Piyush Patel ,  Michael Siegel ,  Fabrice Verplanken

    发明人： Brian Bass ,  Jean Calvignac ,  Marco Heddes ,  Antonios Maragkos ,  Piyush Patel ,  Michael Siegel ,  Fabrice Verplanken

    IPC分类号： G06F17/30 ,  H04L12/46 ,  H04L12/56 ,  G06F7/00

    CPC分类号： H04L45/742 ,  H04L45/7453 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99936 ,  Y10S707/99937 ,  Y10S707/99943 ,  Y10S707/99945

    摘要： Novel data structures, methods and apparatus for finding a full match between a search pattern and a pattern stored in a leaf of the search tree. A key is input, a hash function is performed on the key, a direct table (DT) is accessed, and a tree is walked through pattern search control blocks (PSCBS) until reaching a leaf. The search mechanism uses a set of data structures that can be located in a few registers and regular memory, and then used to build a Patricia tree structure that can be manipulated by a relatively simple hardware macro. Both keys and corresponding information needed for retrieval are stored in the Patricia tree structure. The hash function provides an n->n mapping of the bits of the key to the bits of the hash key. The data structure that is used to store the hash key and the related information in the tree is called a leaf. Each leaf corresponds to a single key that matches exactly with the input key. The leaf contains the key as well as additional information. The length of the leaf is programmable, as is the length of the key. The leaf is stored in random access memory and is implemented as a single memory entry. If the key is located in the direct table then it is called a direct leaf.

    摘要翻译： 用于在搜索图案和存储在搜索树的叶中的模式之间找到完全匹配的新型数据结构，方法和装置。 输入密钥，对密钥执行散列函数，访问直接表（DT），并通过模式搜索控制块（PSCBS）走树，直到到达叶。 搜索机制使用一组可以位于几个寄存器和常规内存中的数据结构，然后用于构建可由相对简单的硬件宏操作的Patricia树结构。 检索所需的两个密钥和相应的信息都存储在Patricia树结构中。 散列函数提供密钥的比特到散列密钥的比特的n> n映射。 用于存储散列键和树中相关信息的数据结构称为叶。 每个叶对应于与输入键完全匹配的单个键。 叶包含关键以及其他信息。 叶片的长度是可编程的，密钥的长度也是可编程的。 叶存储在随机存取存储器中，并被实现为单个存储器条目。 如果键位于直接表中，则称为直接叶。

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

    公开(公告)号：US20060265363A1

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

    申请号：US11457952

    申请日：2006-07-17

    申请人： Jean Calvignac ,  Gordon Davis ,  Marco Heddes ,  Michael Siegel

    发明人： Jean Calvignac ,  Gordon Davis ,  Marco Heddes ,  Michael Siegel

    IPC分类号： G06F17/30

    CPC分类号： H04L49/3009 ,  G11C15/00 ,  H04L45/745 ,  H04L45/7453 ,  H04L49/90

    摘要： 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是否用于标识与所接收的数据分组相关联的数据结构。 根据寄存器中的表定义，内部处理器可以作出这样的确定。

    PRIORITY BASED BANDWIDTH ALLOCATION WITHIN REAL-TIME AND NON-REAL TIME TRAFFIC STREAMS
    9.
    发明申请
    PRIORITY BASED BANDWIDTH ALLOCATION WITHIN REAL-TIME AND NON-REAL TIME TRAFFIC STREAMS 有权
    在实时和非实时交通流中基于优先级的带宽分配

    公开(公告)号：US20070081456A1

    公开(公告)日：2007-04-12

    申请号：US11608295

    申请日：2006-12-08

    申请人： Brahmanand Gorti ,  Marco Heddes ,  Clark Jeffries ,  Andreas Kind ,  Michael Siegel

    发明人： Brahmanand Gorti ,  Marco Heddes ,  Clark Jeffries ,  Andreas Kind ,  Michael Siegel

    IPC分类号： H04L12/26 ,  H04L12/56

    CPC分类号： H04L47/6215 ,  H04L47/10 ,  H04L47/2416 ,  H04L47/2433 ,  H04L47/30 ,  H04L47/32 ,  H04L47/50 ,  H04L47/52 ,  H04L47/56

    摘要： A method and system for transmitting packets in a packet switching network. Packets received by a packet processor may be prioritized based on the urgency to process them. Packets that are urgent to be processed may be referred to as real-time packets. Packets that are not urgent to be processed may be referred to as non-real-time packets. Real-time packets have a higher priority to be processed than non-real-time packets. A real-time packet may either be discarded or transmitted into a real-time queue based upon its value priority, the minimum and maximum rates for that value priority and the current real-time queue congestion conditions. A non-real-time packet may either be discarded or transmitted into a non-real-time queue based upon its value priority, the minimum and maximum rates for that value priority and the current real-time and non-real-time queue congestion conditions.

    摘要翻译： 一种用于在分组交换网络中传送分组的方法和系统。 可以基于处理它们的紧急性来优先考虑由分组处理器接收的分组。 紧急处理的数据包可以称为实时数据包。 不紧急处理的数据包可能被称为非实时数据包。 实时数据包的优先级要高于非实时数据包。 可以根据其值优先级，该值优先级的最小和最大速率以及当前实时队列拥塞条件，将实时分组丢弃或传输到实时队列中。 可以基于其值优先级，该值优先级的最小和最大速率以及当前的实时和非实时队列拥塞将非实时分组丢弃或发送到非实时队列 条件。

    Methods and Apparatus for Sensing Organic Tissue
    10.
    发明申请
    Methods and Apparatus for Sensing Organic Tissue 有权
    用于感应有机组织的方法和装置

    公开(公告)号：US20130162459A1

    公开(公告)日：2013-06-27

    申请号：US13337472

    申请日：2011-12-27

    申请人： Nadav Aharony ,  Michael Siegel

    发明人： Nadav Aharony ,  Michael Siegel

    IPC分类号： G01S13/02

    CPC分类号： G01S13/003 ,  G01S11/02 ,  G01S13/04

    摘要： In exemplary implementations of this invention, a radio signal is transmitted between a transmitter and a receiver. Either the transmitter, or receiver, or both, have a directional antenna. When organic tissue passes between (or is stationary between) the transmitter and receiver, the tissue causes a reduction of the received signal strength (RSS) of the signal, as compared to a baseline RSS. The larger the amount of tissue, the greater is the reduction of the RSS. By analyzing the degradation of the signal, information about organic tissue between the transmitter and receiver may be determined. For example, the number of persons passing through a physical threshold may be determined. Or the fact that one person is walking faster than, and catching up with, a second person as they pass between the transmitter and receiver may be determined.

    摘要翻译： 在本发明的示例性实现中，在发射机和接收机之间传送无线电信号。 发射机或接收机或两者都具有定向天线。 当有机组织在发射器和接收器之间通过（或者在其之间）时，与基线RSS相比，组织导致信号的接收信号强度（RSS）的降低。 组织量越大，RSS的减少就越大。 通过分析信号的劣化，可以确定关于发射机和接收机之间的有机组织的信息。 例如，可以确定通过物理阈值的人数。 或者一个人在发射机和接收机之间通过的情况下，第二人可以确定一个人比行进速度更快，并且追赶的事实。