一种基于Trie的IPv6路由查找方案  

AN IPv6 ROUTING LOOKUP SCHEME BASED ON TRIE

作　　者：孙为[1] 赵永精[2] 宋健[1] 

机构地区：[1]兰州理工大学网络教育学院,甘肃兰州730050 [2]兰州理工大学计算机与通信学院,甘肃兰州730050

出　　处：《计算机应用与软件》2008年第7期35-36,50,共3页Computer Applications and Software

基　　金：国家重点基础研究发展计划(2003CB314802)

摘　　要：随着Internet的迅猛发展,IPv6技术必将成为主流。于是,如何高效地在路由表中查找匹配128位IPv6地址,成为了IPv6技术发展的一大制约因素。经大量研究表明,Trie数据结构是实现高速路由查找和报文转发的关键。结合IPv6的地址结构特点,设计出基于Trie数据结构的查找算法,提高了路由查找效率以及报文转发速度。With the rapid development of Internet, the technology of IPv6 will be the mainstream. Thus, it is the key to find a new way that can match 128-bit IPv6 address in routing table with a quite high speed. After a mass of studies, we find that the Trie data structure is the key to achieve a high speed for routing lookup and packet forwarding. According to the character of IPv6 address structure, in this paper it provides a new searching algorithm based on Trie, which can highly promote the searching efficiency of routing lookups and the speed of forwarding packets.

关 键 词：路由查找 IPV6 TRIE树 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TP393.4[自动化与计算机技术—计算机科学与技术]