| 基于TCAM的二级路由查找 |
| |
| 引用本文： | 刘鹏,张兴明.基于TCAM的二级路由查找[J].计算机工程,2007,33(4):108-109. |
| |
| 作者姓名： | 刘鹏 张兴明 |
| |
| 作者单位： | 国家数字交换系统工程技术研究中心,郑州,450002 |
| |
| 摘 要： | 功率消耗大是三态内容寻址存储器(TCAM)的主要缺点之一。根据TCAM的可配置特性，提出了基于TCAM的二级路由查找，大大降低了TCAM的功耗。给出了基于比特选择的二级路由查找方案并对其进行了性能分析。最后介绍了二级路由查找下的路由更新算法。
|
| 关 键 词： | 路由查找 哈希 三态内容寻址存储器 最长匹配 |
| 文章编号： | 1000-3428（2007）04-0108-02 |
| 修稿时间： | 2006-02-23 |
Two-step Routing Lookup Based on TCAM |
| |
| LIU Peng,ZHANG Xingming.Two-step Routing Lookup Based on TCAM[J].Computer Engineering,2007,33(4):108-109. |
| |
| Authors: | LIU Peng ZHANG Xingming |
| |
| Affiliation: | (Engineering & Technological R&D Center of National Digital Switching System, Zhengzhou 450002) |
| |
| Abstract: | High power consumption is a major drawback of ternary content-addressable memory(TCAM).Based on their configurable property,this paper proposes two-step routing lookup algorithms based on TCAM,which reduces the consumption efficiently.The implementation based on bit-selection is presented and the worst-case analysis is given.At last,the routing table updating algorithm is presented. |
| |
| Keywords: | Routing lookup Hash TCAM Longest prefix match |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
