基于无冲突哈希表和多比特树的两级IPv6路由查找算法
发布时间：2019-06-04 19:24
【摘要】：为了提高IPv6的路由查找效率,根据IPv6路由前缀分布规律和前缀层次关系,提出了基于无冲突哈希表和多比特树的两级IPv6路由查找算法。该算法将地址前缀划分区间并按长度为32,40,48比特分别存储于3个哈希表中,剩下不足的前缀比特由多比特树存储,IPv6路由查找时在无冲突哈希表和多比特树中两级查找。实验表明,该查找算法的平均查找路径数为1.0～1.7,适用于高速的IPv6路由查找。
[Abstract]:In order to improve the efficiency of routing lookup in IPv6, a two-level IPv6 routing lookup algorithm based on conflict-free hash table and multi-bit tree is proposed according to the distribution of IPv6 routing prefix and prefix hierarchy. In this algorithm, the address prefix is divided into intervals and stored in three hash tables according to the length of 32, 40 and 48 bits, respectively. the remaining prefix bits are stored by the Dobit tree, and the IPv6 routing search is found at two levels in the conflict-free hash table and the Dobit tree. The experimental results show that the average number of search paths is 1.0 鈮，
本文编号：2492948
[Abstract]:In order to improve the efficiency of routing lookup in IPv6, a two-level IPv6 routing lookup algorithm based on conflict-free hash table and multi-bit tree is proposed according to the distribution of IPv6 routing prefix and prefix hierarchy. In this algorithm, the address prefix is divided into intervals and stored in three hash tables according to the length of 32, 40 and 48 bits, respectively. the remaining prefix bits are stored by the Dobit tree, and the IPv6 routing search is found at two levels in the conflict-free hash table and the Dobit tree. The experimental results show that the average number of search paths is 1.0 鈮，
本文编号：2492948
本文链接：https://www.wllwen.com/guanlilunwen/ydhl/2492948.html
