山东农业大学学报（自然科学版）Issue(4)：607-612,6.DOI:10.3969/j.issn.1000-2324.2015.04.026
基于三级索引和Trie的IPv6路由查找算法研究
The Study on IPv6 Routing Lookup Algorithm Based on Three-level Index and Multi-bit Trie
摘要
Abstract
The rapid development of Internet facilitates the exponential growth in the number of forwarded packets of core router for backbone network and the rapid IP routing lookup algorithm is a key for achieving the high-speed packet forwarding. The application of IPv6 requires the routing lookup algorithm to adapt to the characteristics of IPv6 address. This paper analyzed the typical routing lookup algorithm based on Trie and summarized the advantages and disadvantages of various algorithms. Combining the characteristics of IPv6 address and the distribution laws of address prefixes in the routing table of backbone router, this paper proposed a rapid IPv6 routing lookup algorithm based on the three-level index table and the multi-bit Trie. It was easier to be achieved a faster speed in lookup and updating and required a smaller storage space comparing with other similar algorithms.关键词
索引表/多比特Trie/路由查找/IPv6Key words
Index table/multi-bit Trie/routing lookup/IPv6分类
信息技术与安全科学引用本文复制引用
刘阳..基于三级索引和Trie的IPv6路由查找算法研究[J].山东农业大学学报（自然科学版）,2015,(4):607-612,6.基金项目
滨州学院“青年人才创新工程”科研基金(BZXYQNLG200903)；滨州市软科学研究计划项目(2014RKX18) （BZXYQNLG200903）
