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

doi:10.11772/j.issn.1001-9081.2014.03.0615

计算机应用 ›› 2014, Vol. 34 ›› Issue (3): 615-618.DOI: 10.11772/j.issn.1001-9081.2014.03.0615

• 网络与通信 • 下一篇

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

黄胜,张卫,吴川川,陈胜蓝

重庆邮电大学光纤通信技术重点实验室，重庆400065

收稿日期:2013-09-10 修回日期:2013-11-13 发布日期:2014-04-01 出版日期:2014-03-01
通讯作者: 张卫
作者简介:黄胜(1974-)，男，湖北英山人，副教授，博士，主要研究方向：光网络、计算机网络、未来互联网络体系结构；张卫(1987-)，男，陕西西安人，硕士研究生，主要研究方向：计算机网络、未来互联网络路由查找机制；吴川川(1987-)，男，河南宝丰人，硕士研究生，主要研究方向：网络资源虚拟化；陈胜蓝（1986-），男，重庆人，硕士研究生，主要研究方向：未来互联网数据存储策略。
基金资助:
国家自然科学基金资助项目;重庆市自然科学基金资助项目;重庆市教委项目

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

HUANG Sheng,ZHANG Wei,WU Chuanchuan,CHEN Shenglan

Key Laboratory of Optical Fiber Communication Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China

Received:2013-09-10 Revised:2013-11-13 Online:2014-04-01 Published:2014-03-01
Contact: ZHANG Wei
Supported by:
;Chongqing city board of education projects

摘要/Abstract

摘要：

针对现有路由表查找方法效率低的问题，提出了一种基于多分支优先级树的数据查找算法。该算法将优先级较高的前缀依次存储在原多分支树的虚节点上，将需要进行扩展的前缀存储在辅助存储结构中，从而在路由查找时，该方法可在内部节点找到最长前缀匹配而无需查找到叶子节点，同时避免了在路由表更新时对路由表的重建。仿真结果表明，提出的查找算法能够有效减少在对路由表查找、插入和删除操作所需的内存访问次数，并大幅度地提高路由查找及其更新速率。

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

Abstract:

Concerning the low efficiency of present methods of IP lookup, a new data lookup algorithm based on Multi-Bit Priority Tries (MBPT) was proposed in this paper. By storing the prefixes with higher priority in dummy nodes of multi-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.

Key words: IP address lookup, multi-bit trie tree, longest matching prefix, Multi-Bit Priority Tries (MBPT) tree

中图分类号:

TP393.071

黄胜张卫吴川川陈胜蓝. 基于多分支优先级树的IP路由查找算法[J]. 计算机应用, 2014, 34(3): 615-618.

HUANG Sheng ZHANG Wei WU Chuanchuan CHEN Shenglan. IP address lookup algorithm based on multi-bit priority tries tree[J]. Journal of Computer Applications, 2014, 34(3): 615-618.

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

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

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 1

编辑推荐

Metrics