摘要
随着IPv6协议的广泛应用，传统的IPv4路由表查找算法不再适应IPv6网络环境中路由转发的需要。IPv6具有巨大的地址空间，未来要面对的将会是海量IPv6路由表，而且128位的IPv6地址比IPv4需要更多的访存数。分析了IPv6路由结构的特点，介绍了IPv6中的各种路由查找技术，提出了基于聚集位向量的快速路由查找算法，并对该算法和常用的二分查找算法的性能进行了分析比较，实验结果表明该算法较好地提高了查找速度，减少了对内存的消耗。
With wide deployment of IPv6 protocol, traditional IPv4 route lookup algorithms are no longer suitable for packet forwarding of IPv6 routers. The IPv6 routing lookup algorithms need to process huge route tables in the future owing to the huge address space of IPv6, and each lookup needs more memory accesses than IPv4 algorithms because of the 128 bits address. This paper analyzes the characteristics of IPv6 routing structure in detail,introduces various techniques of IPv6 routing lookup, proposes a fast algorithm based on aggregated bit vector for routing lookup and compares the performances of the algorithm with common binary search algorithms. The experimental results indicate that the algorithm improves the speed of search and decreases the memory use.
出处
《后勤工程学院学报》
2007年第4期87-91,共5页
Journal of Logistical Engineering University
基金
湖北省自然科学基金(2006ABA256)
关键词
聚集位向量
IPV6
路由查找算法
aggregated bit veetor
IPv6
algorithm for routing lookup
