基于分段密集压缩技术的IPv6查找算法  

An IPv6 Route Lookup Algorithm Based on Subsection Intensive Compression

作　　者：林其德[1] 杜慧敏[2] 王亚刚[1] 

机构地区：[1]西安邮电大学计算机学院,西安710061 [2]西安邮电大学电子工程学院,西安710061

出　　处：《计算机测量与控制》2013年第10期2759-2761,2803,共4页Computer Measurement &Control

基　　金：国家自然科学基金项目(60976020)

摘　　要：随着IPv6网络的发展,路由前缀表项数量急剧增加,但其分布依然很稀疏;因此提出了一种适用于IPv6的分段密集压缩技术,将稀疏的路由前缀表项经过分段密集压缩之后再进行存储,并且在此基础上提出了一种IPv6路由查找算法;基于该密集压缩技术的IPv6查找算法用流水线方法实现,并下载到Xilinx ML605开发板上进行验证,结果表明该技术所占用存储资源为15.33M,平均访问内存周期为2,可应用于高速的IPv6路由查找中。Abstract.. With the development of IPv6 network, the number of routing prefix is increasing rapidly, but its distribution is still very sparse. This paper presents a new lookup algorithm based on subsection intensive compression technology. The sparse routing entries go into intensive compression processing, then the compressed entries are stored, which can achieve high efficient storage utilization. This algorithm implemented with pipeline design and is verified Oil Xilinx ML605 demo--board. It turns out that this algorithm occupies 15. 33M of storage resource , and the average access memory cycle is 2, which can be applied to high--speed IPv6 routing lookup.

关 键 词：IPV6 路由查找 路由表项密集压缩 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]