基于前缀区间和前缀层次(PRPL)的IPv6路由查找算法  

An IPv6 routing lookup algorithm based on prefix range and prefix level(PRPL)

作　　者：赵国锋[1] 李振强[1] 黄小红[1] 马严[1,2] 

机构地区：[1]北京邮电大学计算机科学与技术学院,北京100876 [2]北京邮电大学信息网络中心,北京100876

出　　处：《高技术通讯》2008年第4期345-349,共5页Chinese High Technology Letters

基　　金：973计划(2003CB314806);国家自然科学基金(60772111)资助项目

摘　　要：通过对前缀区间(PR)和前缀层次(PL)的研究,并结合 IPv6全球单播地址和 IPv6骨干网路由表的特征,提出了一种基于前缀区间和前缀层次(PRPL)的高性能的 IPv6路由查找算法。通过使用合成的不同数据量的 IPv6路由表对该算法进行了测试,测试结果表明该算法的可扩展性非常出色,它能够支持数据量达到200k 的大路由表。与同样环境下的经典算法的测试结果进行了比较,比较结果也表明该算法在平均查找速度和内存消耗方面都有一定的优势。出色的性能和对大路由表的支持,使得该算法能够应用到骨干网IPv6路由器中。Through the thorough researches on prefix range, prefix level and the characteristics of IPv6 global unicast address and IPv6 route tables in backbone networks, a novel IPv6 routing lookup algorithm based on prefix range and prefix level （PRPL） was proposed, This new algorithm was tested with synthetic IPv6 routing tables of different sizs, The result showed that this algorithm was excellent in its scalability, which can support the big routing table with the size up to 200k. It was also compared with existing classical algorithms in the same environment and the experimental result indicated that it had an advantage in search speed and memory consumption. With the excellent performance and the support to large scale routing tables, the new algorithm could be used in IPv6 backbone network routers.

关 键 词：路由查找 前缀区间 前缀层次 IPV6 

分 类 号：TN915.04[电子电信—通信与信息系统]