期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于Trie树分割路由表降低TCAM功耗的方法 被引量：2

Trie-based Route Table Partition for Reducing Power Consumption of TCAM
下载PDF
导出
摘要 TCAM已成为在路由器设计中实现路由查找的硬件方案,具有速度快、实现简单的优点,但其功耗较高。该文提出了一种基于trie树的结构进行路由表分割、降低TCAM功耗的方法,同传统的TCAM相比,前缀数量达到200时降低大约80%的功耗,前缀数量越多,相对降低的比例越大。 TCAMs are popular for designing forwarding engine on the router. They are fast and simply to implement. However, the main drawback is high power consumption. This paper presents a scheme that use trie data structure for partitioning the routing table into TCAM blocks to improve power efficiency. Compared with traditional TCAM, the scheme can reduce the power consumption by about 80% for 200 prefixes and more reduced ration for more prefixes.
作者 刘丹 赵有健
机构地区 清华大学计算机系
出处 《计算机工程》 CAS CSCD 北大核心 2007年第11期100-102,共3页 Computer Engineering
关键词 TRIE TCAM 路由表分割 功耗 Trie TCAM Route table partition Power consumption
分类号 TP393.02 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献5

  • 1Panigrahy R,Sharma S.Reducing TCAM Power Consumption and Increasing Throughput[C]//Proc.of the 10^th Symposium on High Performance Interconnects Hot Interconnects.2002.
  • 2Jaehyung P,Young C M,Jinsoo K,et al.A Distributed Architecture of the Indirect IP Lookup Scheme for High-speed Routers,Parallel and Distributed Computing:Applications and Technologies[C]//Proc.of the 5th International Conference on PDCAT.2004:519-526.
  • 3Zheng Kai,Lu Hongbin,Liu Bin.A Parallel IP Lookup Algorithm for Terabit Router[C]//Proceedings of the International Conference on Information Technology.2003:478-481.
  • 4Venkatesh K,Aravind S.A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization[C]//Proceedings of the International Conference on Information Technology.2004.
  • 5Zheng Kai,Hu Chengchen,Lu Hongbin,et al.An Ultra High Throughput and Power Efficient TCAM-based IP Lookup Engine[C]// Proc.of IEEE INFOCOM'04.2004.

同被引文献24

  • 1王立涛,李东,殷丽华.一种基于B-树的IPv6路由查找算法[J].微计算机信息,2008,24(1):243-245. 被引量：3
  • 2崔尚森,张白一.一种基于哈希表和Trie树的快速IP路由查找算法[J].计算机工程与应用,2005,41(9):156-158. 被引量：7
  • 3Ruiz-Sanchez M A,Biersack E W,Dabbous W.Survey and Taxonomy of IP Address Lookup Algorithms[J].IEEE Network,2001,15(2):8-23.
  • 4Kim Nam-Soo,Kim Young-Sang.Comparative Studies of Address Lookup Algorithms for IPv6[C]//Proc.of ICACT’06.Hong Kong,China:[s.n.],2006:285-290.
  • 5Gamache B,Pfeffer Z,Khatri S P.A Fast Ternary CAM Design for IP Networking Applications[C]//Proc.of the 12th International Conference on Computer Communications and Networks.Dallas,USA:[s.n.],2003:434-439.
  • 6Erdem O,Bazlama X E,Bazlama·i C F.Array Design for Trie-based IP Lookup[J].Communications Letters,2010,14(8):773-775.
  • 7Zheng Kai,Liu Zhen,Liu Bin.A Scalable IPv6 Route Lookup Scheme via Dynamic Variable-stride Bitmap Compression and Path Compression[J].Computer Communications,2006,29(16):3037-3050.
  • 8Chu Yuansun,Su Huikai,Lin Pofeng,et al.IC Design of IPv6 Routing Lookup for High Speed Networks[C]//Proc.of the 6th International Conference on Computational Science.New York,USA:[s.n.],2006:1832-1835.
  • 9Li Zhenqiang,Deng Xiaohong,Ma Hongxiao,et al.Divide and Conquer:A Scheme for IPv6 Address Longest Prefix Matching[C]//Proc.of Workshop on High Performance Switching and Routing.Hong Kong,China:[s.n.],2006:37-42.
  • 10Gamache B,Pfeffer Z,Khatri S P.A Fast Ternary CAM Design for IP Networking Applications[C]//Proc.of the 12th International Conference on Computer Communications and Networks.Dallas,USA:[s. n. ],2003:434-439.

引证文献2

二级引证文献3

计算机工程
2007年 第11期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部