会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明公开
    • Method for increasing average storage capacity in a bit-mapped tree-based storage
    • 方法zurErhöhungder durchschnittlichenSpeicherkapazität在einem bitgeordneten baumbasierten Speicher
    • EP1434147A2
    • 2004-06-30
    • EP03257664.7
    • 2003-12-05
    • STMicroelectronics, Inc.
    • Huang, Lun BinRajgopal, SureshRichardson, Nicholas Julian
    • G06F17/30
    • G06F17/30985G06F17/30625H04L45/00H04L45/54H04L45/7457Y10S707/922Y10S707/99933
    • Sparsely distributed prefixes within a bitmapped multi-bit trie are compressed by: replacing a single entry table string terminating with a single prefix end node with a parent table entry explicitly encoding a prefix portion; replacing a table with only two end nodes or only an end node and an internal node with a single parent table entry explicitly encoding prefix portions; replacing two end nodes with a single compressed child entry at a table location normally occupied by an internal node and explicitly encoding prefix portions; and/or replacing a plurality of end nodes with a prefix-only entry located at the table end explicitly encoding portions of a plurality of prefixes. The compressed child entry and the prefix-only entry, if present, are read by default each time the table is searched. Run length encoded allows variable length prefix portions to be encoded.
    • 位映射的多位特里内的稀疏分布前缀通过以下方式进行压缩:通过明确编码前缀部分的父表项替换单个前缀结束节点终止的单个条目表字符串; 用只有两个端节点或只有一个端节点和一个内部节点替换一个表,其中单个父表条目明确地编码前缀部分; 在通常由内部节点占用的表位置处使用单个压缩子条目替换两个端节点并且明确地编码前缀部分; 和/或用位于表端的仅限前缀的条目替换多个端节点来明确地编码多个前缀的部分。 每次搜索表时,默认读取压缩子条目和仅前缀条目(如果存在)。 编码的运行长度允许编码可变长度前缀部分。
    • 10. 发明公开
    • System and method for path compression optimization in a pipelined hardware bitmapped multi-bit trie algorithmic network search engine
    • 装置和方法用于与流水线硬件位优化算法搜索发电机路径压缩映射的多比特线索结构
    • EP1429501A1
    • 2004-06-16
    • EP03257793.4
    • 2003-12-11
    • STMicroelectronics, Inc.
    • Huang, Lun BinRichardson, Nicholas JulianRajgopal, Suresh
    • H04L12/56
    • H04L45/00H04L45/54H04L45/7457
    • For use in a pipeline network search engine of a router, a path compression optimization system and method is disclosed for eliminating single entry trie tables. The system embeds in a parent trie table (1) path compression patterns that comprise common prefix bits of a data packet and (2) skip counts that indicate the length of the path compression patterns. The network search engine utilizes the path compression patterns and the skip counts to eliminate single entry trie tables from a data structure. Each path compression pattern is processed one stride at a time in subsequent pipeline stages of the network search engine. The elimination of unnecessary single entry trie tables reduces memory space, power consumption, and the number of memory accesses that are necessary to traverse the data structure.
    • 对于路由器的管道网络搜索引擎的使用,路径压缩优化的系统和方法是对游离缺失消除单次入境线索表盘。 该系统嵌入在父特里结构表(1)路径压缩模式所做的数据包,(2),则跳过计数的包括公共前缀比特没有指示路径压缩模式的长度。 网络搜索引擎利用的路径压缩模式和跳过计数,以消除来自数据结构单个条目字典树表。 每个路径压缩模式处理的一个步幅在网络搜索引擎的后续流水线级的时间。 不必要单个条目字典树表的消除减少内存空间,功耗,以及存储器访问的次数是必要的那样遍历数据结构。