一种快速IPv6路由查找方案  

A Fast IPv6 Route Lookup Scheme

作　　者：姚兴苗[1] 李乐民[1] 

机构地区：[1]电子科技大学宽带光纤传输与通信系统技术重点实验室,成都610054

出　　处：《计算机学报》2005年第2期214-219,共6页Chinese Journal of Computers

摘　　要：提出了一个可硬件实现的基于分段的快速IPv6路由查找方案.该方案支持快速的IP地址查找,并能有效地对路由前缀进行插入和删除操作.方案采用基于比特位置区分的压缩算法,与其它的 IPv6 路由查找方案相比较,所需存储器空间小,路由查找的平均时间少.如果采用SRAM流水线查找,可实现 125×106次/秒的查找速度.由于缺少实际的 IPv6路由前缀,该文生成了模拟路由前缀数据库.仿真试验结果表明:文章提出的方案具有合理的查找时间、空间和更新复杂度,容易硬件实现.A fast IPv6 route lookup scheme based on segment lookup is proposed in this paper. It supports fast IP address lookup and can insert and delete the prefixes effectively. A novel compressed algorithm based on bit position division is applied. Compared with other schemes, it needs less memory space and lookup time. By using SRAM pipeline, a lookup speed of 125×10 6 per/second can be realized. As there is lack of IPv6 route prefixes, simulation database is generated to evaluate the performance. Simulation results show that the scheme has reasonable lookup time, memory space and update time.

关 键 词：IPV6路由查找 分段查找 压缩算法 

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