期刊文献+

TCAM路由表项管理算法优化研究 被引量:5

Improved Algorithm Research of TCAM Routing Entries Management
下载PDF
导出
摘要 TCAM(Ternary Content-Addressable Memory)能够很好的完成最长前缀匹配,实现快速路由查找和分组转发,但是其对路由表项的有序性要求使得表项管理比较复杂。在讨论已有TCAM表项管理算法的基础上,通过分析前缀表项的统计分布特性.对路由表的空间分配进行了优化,同时引入新的基于前缀块指针管理策略,提出了一种改进的表项管理方法,提高了路由表更新效率。 TCAM (Tertiary Content-Addressable Memory) is the popular hardware device for longest prefix matching and implement high-speed packet routing and forwarding. But because route table must be kept in sequence in TCAM, the updating process and entries management become complicated. This paper discusses the present updating algorithms based on TCAM first, and then optimizes the allocation of route space according to analysis of prefixes distributing features. Furthermore, an advanced entries mauagement for route updating is proposed based on prefix block point operation policy to improve updating efficiency.
出处 《微计算机信息》 2009年第9期154-155,114,共3页 Control & Automation
关键词 TCAM 路由更新 表项管理 前缀块指针 TCAM Routing Updating Entries Management Prefix Block Point
  • 相关文献

参考文献6

  • 1D. Shah, P. Gupta, Fast Updating Algorithms For TCAMs [J]. IEEE Micro, 2001, 21(1): 36-47
  • 2AJ. McAuley, P. Francis.Fast Routing Table Lookup Using CAMs[C].Proceedings of the IEEE INFOCOM.San Francisco: IEEE Computer Society Press, 1993:1382-1391
  • 3V. Srinivasan, G. Varghese.Fast Address Lookups Using Controlled Prefix Expansion [J].ACM Transactions on Computer Systems.Oct.1999, 17(1): 1-40
  • 4中国CERNET中心.CERNET中心路由器Global路由表映象[OL].http://bgpview.6test.edu.cn/bgp-view,Oct 2005
  • 5赵峥嵘,李鹏,兰巨龙.TCAM表项管理算法研究[J].微计算机信息,2005,21(08X):38-40. 被引量:6
  • 6王振兴,张彦肖,孙亚民,邬江兴.基于前缀范围对分搜索的高性能路由查找[J].计算机学报,2004,27(5):604-610. 被引量:4

二级参考文献11

  • 1Devavrat Shah,Pankaj Gupta,"Fast Updating Algorithms For TCAMS",IEEE January-Februaty 2001.
  • 2Rekhter Y., Li T.. An architecture for IP address allocation with CIDR. Internet RFC 1518, 1993. ftp://ds.internic.net/rfc/rfc1518.txt
  • 3Hinden R., Deering S.. IP version 6 addressing architecture. Internet RFC 2373, 1998. ftp://ds.internic.net/rfc/rfc2373.txt
  • 4Degermark M., Brodnik A., Carlsson S., Pink S.. Small forwarding tables for fast routing lookups. ACM Computer Communication Review, 1997, 27(4): 3~14
  • 5WaldvogeL M., Varghese G., Turner J., Plattner B.. Scalable high speed IP routing lookups. ACM Computer Communication Review, 1997, 27(4): 27~36
  • 6Gupta P., Lin S., McKeown N.. Routing lookups in hardware at memory access speeds. In: Proceedings of the IEEE INFOCOM'98, San Francisco, 1998, 1240~1247
  • 7Tzeng H.H., Przygiend T.. On fast address-lookup algorithms. IEEE Journal on Selected Areas in Communications, 1999, 17(6): 1067~1082
  • 8Netlogic Microsystems Inc. Ternary Synchronous Content Addressable Memory(IPCAM). Netlogic Microsystems White Paper. http://www.netlogicmicro.com/pdf/NL82721.pdf
  • 9Shah Devavrat, Gupta Pankaj. Fast updating algorithms for TCAMs. IEEE Micro, 2001, 21(1): 36~47
  • 10Kobayashi M., Murase T., Kuriyama A.. A longest prefix match search engine for multi-gigabit IP Processing. In: Proceedings of the IEEE ICC'2000, New Orleans, USA, 2000, 1360~1364

共引文献8

同被引文献35

引证文献5

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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