摘要： 随着IPv6协议的广泛应用，传统的IPv4路由表查找算法不再适应IPv6网络环境中路由转发的需要。该文在基于hash表的二分查找算法基础之上，提出了一种改进算法，该算法应用于超大规模路由表时能表现出较好、稳定的运行效率。为了减小内存消耗，还针对该算法提出了优化方案，并通过实验数据进行了对比分析。
关键词:
IPv6,
分组转发,
最长地址前缀匹配,
路由表查找
Abstract: With wide deployment of IPv6 protocol, traditional IPv4 route lookup algorithms are no longer suitable for packet forwarding of IPv6 routers. Based on the algorithm of binary search on hash tables, this paper describes a new algorithm, ABSH, for best matching prefix of IPv6 address. The algorithm manifests high performance when it is applied to super huge route table. Also, in order to decrease memory use, the paper presents several improving schemes. These schemes are analyzed by experiment data.
Key words:
IPv6,
Packet forwarding,
Best matching prefix,
Route table lookup
中图分类号:
孙庆南;鲁士文. 一种改进的二分法IPv6路由查找算法[J]. 计算机工程, 2006, 32(18): 35-38.
SUN Qingnan; LU Shiwen. Improved Fast IPv6 Route Lookup Algorithm Based on Binary Search
[J]. Computer Engineering, 2006, 32(18): 35-38.