基于多分支优先级树的IP路由查找算法  

IP address lookup algorithm based on multi-bit priority tries tree

作　　者：黄胜[1] 张卫[1] 吴川川[1] 陈胜蓝[1] 

机构地区：[1]重庆邮电大学光纤通信技术重点实验室,重庆400065

出　　处：《计算机应用》2014年第3期615-618,627,共5页journal of Computer Applications

基　　金：国家自然科学基金资助项目(61371096;61071117;61171158;61275077);重庆市自然科学基金资助项目(cstc2013jcyjA40052;cstc2012jjA40060);重庆市教委项目(KJ110519;KJ110527)

摘　　要：针对现有路由表查找方法效率低的问题,提出了一种基于多分支优先级树的数据查找算法。该算法将优先级较高的前缀依次存储在原多分支树的虚节点上,将需要进行扩展的前缀存储在辅助存储结构中,从而在路由查找时,该方法可在内部节点找到最长前缀匹配而无需查找到叶子节点,同时避免了在路由表更新时对路由表的重建。仿真结果表明,提出的查找算法能够有效减少在对路由表查找、插入和删除操作所需的内存访问次数,并大幅度地提高路由查找及其更新速率。Concerning the low efficiency of present methods of IP lookup, a new data lookup algorithm basea on Multi-Bit Priority Tries （MBPT） was proposed in this paper. By storing the prefixes with higher priority in dummy nodes of muhi-bit tries in proper order and storing the prefixes for being extended in an auxiliary storage structure, this algorithm tried to make the structure find the longest matching prefix in the internal node instead of the leaf node. Meanwhile, the algorithm avoided the reconstruction of router-table when it needed to be updated. The simulation results show that the proposed algorithm can effectively minimize the number of memory accesses for dynamic router-table operations, including lookup, insertion and deletion, which significantly improves the speed of router-table lookup as well as update.

关 键 词：IP路由查找 多分支tire树 最长前缀匹配 多分支优先级树 

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