Journal of Computer Applications ›› 2014, Vol. 34 ›› Issue (3): 615-618.DOI: 10.11772/j.issn.1001-9081.2014.03.0615

• Network and communications •     Next Articles

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

HUANG Sheng,ZHANG Wei,WU Chuanchuan,CHEN Shenglan   

  1. 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-03-01 Published:2014-04-01
  • Contact: ZHANG Wei
  • Supported by:

    ;Chongqing city board of education projects



  1. 重庆邮电大学 光纤通信技术重点实验室,重庆400065
  • 通讯作者: 张卫
  • 作者简介:黄胜(1974-),男,湖北英山人,副教授,博士,主要研究方向:光网络、计算机网络、未来互联网络体系结构;张卫(1987-),男,陕西西安人,硕士研究生,主要研究方向:计算机网络、未来互联网络路由查找机制;吴川川(1987-),男,河南宝丰人,硕士研究生,主要研究方向:网络资源虚拟化;陈胜蓝(1986-),男,重庆人,硕士研究生,主要研究方向:未来互联网数据存储策略。
  • 基金资助:



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



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

CLC Number: