LPR-Trie: A Fast IPv6 Routing Lookup Algorithm with Virtual Nodes
LPR-Trie: A Fast IPv6 Routing Lookup Algorithm with Virtual Nodes作者机构:The College of Information EngineeringCapital Normal UniversityBeijing 100048China
出 版 物:《China Communications》 (中国通信(英文版))
年 卷 期:2022年第19卷第10期
页 面:1-11页
核心收录:
学科分类:0810[工学-信息与通信工程] 08[工学] 081001[工学-通信与信息系统]
基 金: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)
主 题:IPv6 route lookup longest prefix match virtual node Trie
摘 要:The number of IPv6 routes in todays backbone routers has grown rapidly,which has put tremendous pressure on route lookup and *** on the analysis of IPv6 address prefix length and distribution characteristics,this paper proposes an IPv6 route lookup architecture called *** core idea of the algorithm is to utilize more spaces and accelerate routing ***,we put forward the concept of virtual nodes,and leverage the link between virtual nodes and ordinary nodes to accelerate routing *** provide the longest prefix routing entry(LPR)calculation algorithm to achieve the longest prefix *** 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 *** paper shows that our design improves the routing lookup speed and have better memory utilization.