期刊文献+

TCAM快更新高速路由查找算法与实现

TCAM Fast-Update High-Speed Routing Lookup Algorithm and its Implementation
下载PDF
导出
摘要 常用的单步TCAM路由查找方案要求转发表的存储必须按前缀长度相对地址降序排列,这种与地址关联的排序操作影响表项的更新速度和路由查找流程的连续性。本文提出并实现了一种独特的对前缀范围对分搜索的IPv4五步TCAM流水查找方法。突出特点是转发表不需排序,查找速率高,表项更新快,查表连续性好,可满足IPv4核心路由器双OC-768(40Gbps)端口、48B包的线速转发。 Single- step .TCAM schemes used in core routers demand entries must be sorted according to prefix lengths in descending order relative to TCAM addresses. The sorting operations related to addresses have disadvantageous effects on the entry updating speed and lookup continuity. A novel routing lookup method based on BSPR ( Bi - search on Prefix Range) is provided and implemented in this paper, which uses 5 - step TCAMs pipelining based on bi - search on prefix range. Its outstanding advantages include that no entry sorting is needed, lookup speed is high, entry updating completes fast with pipelining, and lookup continuity is enhanced. It satisfies wire - speed (48B - packet) forwarding of dual OC - 768 (40Gbps) interfaces of IPv4 core routers.
出处 《电讯技术》 2006年第1期63-67,共5页 Telecommunication Engineering
基金 国家863计划重点项目(2003AA103510)
关键词 核心路由器 IP路由查找 对分搜索 快速更新 查表连续性 TCAM流水处理 路由查找算法 TCAM 更新速度 高速 core router IP routing lookup bi - search fast update lookup continuity TCAM - pipelining
  • 相关文献

参考文献6

  • 1Y Rekhter,T Li.An Architecture for IP Address Allocation with CIDR[EB/OL].http://rfc.net/rfc1518.html,2003-05-06.
  • 2R Hinden,S Deering.IP Version 6 Addressing Architecture[EB/OL].http://rfc.net/rfc2373.html,2003-05-06.
  • 3冯东雷,张勇,白英彩.线速数据包输入处理技术[J].计算机研究与发展,2002,39(1):41-48. 被引量:13
  • 4Anindya Basu,Girija Narlikar.Fast Incremental Updates for Pipelined Forwarding Engines[EB/OL].http://www.ieee-infocom.org/2003/papers,2003-05-11.
  • 5彭元喜,龚正虎.基于LSOT的高速IP路由查找算法[J].计算机学报,2002,25(1):106-111. 被引量:14
  • 6Devavrat Shah,Pankaj Gupta.Fast Updating Algorithms for TCAMs[J].IEEE Micro,2001,21(1):36~47.

二级参考文献56

  • 1[1]Rekhter Y,Li T. An architecture for IP address allocation with CIDR. Internet RFC 1518, September 1993. ftp://ds.internic.net/rfc/rfc1518.txt
  • 2[2]Gupta P, Lin S, McKeown N. Routing lookups in hardware at memory access speeds. In: Proc INFOCOM, San Francisco, 1998.1240-1247
  • 3[3]Degermark M, Brodnik A, Carlsson S, Pink S. Small forwarding tables for fast routing lookups. ACM Computer Communication Review, 1997, 27(4):3-14
  • 4[4]Waldvogel M, Varghese G, Turner J, Plattner B. Scalable high speed IP routing lookups. ACM Computer Communication Review, 1997, 27(4):25-36
  • 5[5]Lampson B, Srinivasan V, Varghese G. IP lookups using multiway and multicolumn search. In: Proc INFORCOM, San Francisco, 1998.1248-1256
  • 6[6]Srinivasan V, Varghese G. Faster IP lookups using controlled prefix expansion. In: Proc SIGMETRICS 98, Madison, 1998. 1-10
  • 7[7]Sklower K. A tree-based packet routing table for Berkeley Unix. In: Proc the 1991 Winter USENIX Conference, Dallas, 1991.93-99
  • 8[8]McAuley A J, Francis P. Fast routing table lookup using CAMs. In: Proc IEEE INFOCOM, San Francisco, 1993, 3:1382-1391
  • 9[9]Labovitz C, Malan G, Jahanian F. Internet routing instability. ACM Computer Communication Review, 1997, 27(4):115-126
  • 10V Srinivasan. Fast and efficient Internet lookups[Ph D dissertation]. Stanford University, 1999

共引文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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