首页 | 本学科首页   官方微博 | 高级检索  
     

基于压缩NH表的高速IP路由查找算法的研究
引用本文:彭元喜,唐玉华,龚正虎.基于压缩NH表的高速IP路由查找算法的研究[J].电子学报,2002,30(2):196-199.
作者姓名:彭元喜  唐玉华  龚正虎
作者单位:国防科学技术大学计算机学院,湖南长沙 410073
基金项目:国家 8 63重点攻关项目“核心路由器”(863 30 0 0 1 0 3 99)
摘    要:由于因特网速度不断提高、网络流量不断增加和路由表规模不断扩大,IP路由查找已经成为制约核心路由器性能的主要原因,因而受到了广泛重视.目前人们已经提出几种高速IP路由查找算法,但没有一种是理想的.本文提出一种使用压缩NH表进行IP路由查找的方法,它具有查找速率高、更新时间快、存储代价低、易于实现等特点,能满足10Gbps速率核心路由器环境的要求.

关 键 词:下一跳表  IP路由查找  核心路由器  
文章编号:0372-2112(2002)02-0196-04
收稿时间:2000-05-10

The Study on High-Speed Algorithms of IP Routing Lookups Based on the Compressed Next Hop Table
PENG Yuan xi,TANG Yu hua,GONG Zheng hu.The Study on High-Speed Algorithms of IP Routing Lookups Based on the Compressed Next Hop Table[J].Acta Electronica Sinica,2002,30(2):196-199.
Authors:PENG Yuan xi  TANG Yu hua  GONG Zheng hu
Affiliation:Computer School,National University of Defense Technology,Changsha,Hunan 410073,China
Abstract:The problem of IP routing lookups has received much attention recently because It is one of the main reasons why performance of core routers in the Internet becomes the bottleneck.Several algorithms for solving this problem have been proposed,but none is ideal.In this paper we propose an algorithm of IP routing lookups using compressed next hop table.The algorithm has characteristics such as fast search time,fast update time,small memory space and easy implementation,and can be used in core routers that have 10Gbps interfaces.
Keywords:NH(Next Hop) table  IP routing lookup  core router
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号