期刊文献+

高性能TCAM路由查找表研究与设计 被引量:1

Research and design of high performance TCAM routing lookup table
下载PDF
导出
摘要 TCAM是高性能路由器中查找性能强大的硬件查找结构,但是其价格昂贵且功耗大。为了解决这个问题,本文提出了一种实现方案,从而优化了TCAM电路结构且提高了性能。用Verilog HDL语言进行描述,采用Altera公司的FPGA开发权,基于CycloneⅢ单元库进行FPGA验证,此方案其时钟频率为100MHz,功耗降低50%。 TCAM is a most powerful hardware lookup table,however,it is of big cost and high power consumption.In order to solve the problems,this paper presents an implementation for optimizing the circuit structure and enhancing the performance on TCAM.This scheme is described in Verilog HDL and implemented by the Cyclone Ⅲ based FPGA of Altera Corporation.The clock frequency of this scheme is 100Hz,and power consumption reduces by 50%.
出处 《西安邮电学院学报》 2010年第1期110-114,共5页 Journal of Xi'an Institute of Posts and Telecommunications
基金 国家自然科学基金资助(60976020) 陕西省教育厅项目资助(08JK429)
关键词 TCAM 路由查找表 高性能路由器 最长前缀匹配 TCAM routing lookup table high performance router the longest prefix mate
  • 相关文献

参考文献6

  • 1D. Shah,P. Gupta, Fast updating algorithms for TCAMS [J].IEEE Micro,2001, 21(1):36 -47.
  • 2M. Akhbarizadeh, M. Nourani, D. Vijayasarathi, P. Balsara.PCAM:A Ternary CAM. Optimized for Longest Pr - efix Matching Tasks[J ]. Proc. 2004 IEEE. Int' l Conf. on Computer Design(ICCD' 04), Oct, 2004: 6 - 11.
  • 3Daxiao Yu, B.C. Smith, and B. Wei, Forwarding engine for fastrouting lookups and updates [ J ], IEEE GLOBECO- M' 99, vol. 2, pp. 1556 - 1564.
  • 4Miguel A. Ruiz- Sanchez, "Survey and Taxonomy of IP Address Lookup Algorithms" [J ]. IEEE Network,March/ April. pp. 8 - 23.
  • 5[美]Panos C.Lekkas著,赵有健,刘丹等译.网络处理器体系结构、协议与平台[M].北京:人民邮电出版社,2006.
  • 6王亚刚,杨康平,杜慧敏.一种基于TCAM的PLO_OPT算法的改进[J].西安邮电学院学报,2009,14(3):83-86. 被引量:1

二级参考文献4

  • 1D. Shah,P. Gupta, Fast updating algorithms for TCAMS [J]. IEEE Micro,2001, 21(1) :36-47.
  • 2M. Akhbarizadeh, M. Nourani, D. Vijayasarathi and P. Balsam. PCAM: A Ternary CAM. Optimized for Longest Prefix Matching Tasks[J]. Proc.2004 IEEE. Int'l Conf. on Computer Design (ICCD'04),Oct.2004: 6-11.
  • 3Daxiao Yu, B.C. Smith, and B. Wei. Forwarding engine for fastrouting lookups and updates [ J ]. IEEE GLOBECOM' 99, vol. 2:1556 - 1564.
  • 4Miguel A. Ruiz- Sanchez. Survey and Taxonomy of IP Address Lookup Algorithrns[J ]. IEEE Network, March/ April. pp. 8 - 23.

同被引文献16

  • 1Fu Jing, Rexford J. Efficient IP-address Lookup with a Shared Forwarding Table for Multiple Virtual Routers[C]// Proc. of the 4th International Conference on Emerging Networking Experiments and Technologies. Madrid, Spain ACM Press, 2008.
  • 2Psenak P, Mirtorabi S, Roy A, et al. Multi-Topology(MT) Routing in OSPF[EB/OL]. (2012-06-15). http://www.ietf. org/rfc/rfc4915.txt.
  • 3Srinivasan V, Varghese G. Faster IP Lookups Using Controlled Prefix Expansion[C]//Proc. of the 1998 Joint International Conference on Measurement and Modeling of Computer Systems. Madison, USA: ACM Press, 1998.
  • 4Eatherton W, Varghese G, Dittia Z. Tree Bitmap: Hardware/software IP Lookups with Incremental Updates[J].ACM SIGCOMM Computer Communication Review, 2004, 34(2): 97-122.
  • 5Song Haoyu, Turner J, Lockwood J. Shape Shifting Tries for Faster IP Lookup[C]/lProc. of the 13th IEEE International Conference on Netvcork Protocols. Boston, USA: IEEE Press, 2005.
  • 6Spitznagel E, Taylor D, Turner J. Packet Classification Using Extended TCAMs[C]//Proc. of the llth IEEE International Conference on Network Protocols. Busan, Korea: IEEE Press, 2003.
  • 7Gupta P, McKeown N. Classifying Packets with Hierarchical Intelligent Cuttings[J]. IEEE Micro, 1999, 20(1): 34-41.
  • 8Singh S, Baboescu F, Varghese G, et al. Packet Classification Using Multidimensional Cutting[C]//Proc. of Conference on Computer Communications. Karlsruhe Germany: ACM Press, 2003.
  • 9Gupta P, McKeown N. Packet Classification on Multiple Fields[J]. Computer Communication Review, 1999, 29(4): 147-160.
  • 10Lakshman T V, Stiliadis D. High Speed Policy-based Packet Forwarding Using Efficient Multidimentional Range Matching[J]. Computer Communication Review, 1998, 28(4): 203-214.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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