【摘要】：為了提高IPv6的路由查找效率,根據(jù)IPv6路由前綴分布規(guī)律和前綴層次關(guān)系,提出了基于無沖突哈希表和多比特樹的兩級IPv6路由查找算法。該算法將地址前綴劃分區(qū)間并按長度為32,40,48比特分別存儲于3個哈希表中,剩下不足的前綴比特由多比特樹存儲,IPv6路由查找時在無沖突哈希表和多比特樹中兩級查找。實驗表明,該查找算法的平均查找路徑數(shù)為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