计算机工程 ›› 2007, Vol. 33 ›› Issue (04): 108-109.doi: 10.3969/j.issn.1000-3428.2007.04.037

• 网络与通信 • 上一篇    下一篇

基于TCAM的二级路由查找

刘 鹏,张兴明   

  1. (国家数字交换系统工程技术研究中心,郑州 450002)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-02-20 发布日期:2007-02-20

Two-step Routing Lookup Based on TCAM

LIU Peng, ZHANG Xingming   

  1. (Engineering & Technological R&D Center of National Digital Switching System, Zhengzhou 450002)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-02-20 Published:2007-02-20

摘要: 功率消耗大是三态内容寻址存储器(TCAM)的主要缺点之一。根据TCAM的可配置特性,提出了基于TCAM的二级路由查找,大大降低了TCAM的功耗。给出了基于比特选择的二级路由查找方案并对其进行了性能分析。最后介绍了二级路由查找下的路由更新算法。

关键词: 路由查找, 哈希, 三态内容寻址存储器, 最长匹配

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.

Key words: Routing lookup, Hash, TCAM, Longest prefix match