摘要
在未来的IPv6网络中,将面临的一个严重问题就是由于网络中IP数量的膨胀而引起路由表项的大规模增加,从而导致现有的路由表项的存储策略及查找算法不能很好的适应。本文提出了一种基于B-树的IPv6路由查找算法,阐述了如何通过B-树结构来有效的组织路由表项的存储及查找,从而达到查找效率和存储空间利用的均衡。
In the future IPv6 network, because the amount of IP in the network inflates , we will face a serious problem , that is the quantity of route table items will increase greatly , leading to the current storage policies and lookup algorithms can’t fit well. This paper proposes a IPv6 routing lookup algorithm based on B- Tree, elaborates how to organize effectively the storage and lookup of route table items according to the B- Tree structure, thereby reach the balance of lookup efficiency and usage of storage...
出处
《微计算机信息》
北大核心
2008年第1期243-245,共3页
Control & Automation
基金
国家863-917专项资助项目(2004-研4-AA-01)
