| 一种改进的二分法IPv6路由查找算法 |
| |
| 引用本文： | 孙庆南,鲁士文.一种改进的二分法IPv6路由查找算法[J].计算机工程,2006,32(18):35-38. |
| |
| 作者姓名： | 孙庆南 鲁士文 |
| |
| 作者单位： | 1. 中国科学院计算技术研究所,北京,100080;中国科学院研究生院,北京,100039
2. 中国科学院计算技术研究所,北京,100080 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划) |
| |
| 摘 要： | 随着IPv6协议的广泛应用，传统的IPv4路由表查找算法不再适应IPv6网络环境中路由转发的需要。该文在基于hash表的二分查找算法基础之上，提出了一种改进算法，该算法应用于超大规模路由表时能表现出较好、稳定的运行效率。为了减小内存消耗，还针对该算法提出了优化方案，并通过实验数据进行了对比分析。
|
| 关 键 词： | IPv6 分组转发 最长地址前缀匹配 路由表查找 |
| 文章编号： | 1000-3428（2006）18-0035-04 |
| 收稿时间： | 09 29 2005 12:00AM |
| 修稿时间： | 2005-09-29 |
Improved Fast IPv6 Route Lookup Algorithm Based on Binary Search |
| |
| SUN Qingnan,LU Shiwen.Improved Fast IPv6 Route Lookup Algorithm Based on Binary Search[J].Computer Engineering,2006,32(18):35-38. |
| |
| Authors: | SUN Qingnan LU Shiwen |
| |
| Affiliation: | 1.Institute of Computing Technology, Chinese Academy of Sciences, Beijing 2. Graduate School of Chinese Academy of Sciences, Beijing 100039 |
| |
| 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 lPv6 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. |
| |
| Keywords: | IPv6 |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
|
