LPR-Trie: A Fast IPv6 Routing Lookup Algorithm with Virtual Nodes  

作　　者：Wenlong Chen Diya Liu Jiacheng Wang Xiaolan Tang 

机构地区：[1]The College of Information Engineering,Capital Normal University,Beijing 100048,China

出　　处：《China Communications》2022年第10期1-11,共11页中国通信（英文版）

基　　金：support from the National Natural Science Foundation of China (61872252);National Key Research and Development Program of China (2018YFB1800403);the Beijing Natural Science Foundation (4202012);the Science and Technology Project of Beijing Municipal Commission of Education in China (KM201810028017)

摘　　要：The number of IPv6 routes in todays backbone routers has grown rapidly,which has put tremendous pressure on route lookup and storage.Based on the analysis of IPv6 address prefix length and distribution characteristics,this paper proposes an IPv6 route lookup architecture called LPR-Trie.The core idea of the algorithm is to utilize more spaces and accelerate routing lookup.Moreover,we put forward the concept of virtual nodes,and leverage the link between virtual nodes and ordinary nodes to accelerate routing lookup.We provide the longest prefix routing entry(LPR)calculation algorithm to achieve the longest prefix match.The experimental results show that the virtual node mechanism increases the search speed up to 244%,and the virtual nodes have better stability by setting an appropriate keep-alive time according to the characteristics of actual traffic.This paper shows that our design improves the routing lookup speed and have better memory utilization.

关 键 词：IPV6 route lookup longest prefix match virtual node TRIE 

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