高端路由器CIDR表非关键字索引的B-Tree机制  

A Kind of Non-Key Words Index B-Tree Mechanism in High-End Router CIDR List

作　　者：杜慧军[1] 杨宁[1] 

机构地区：[1]广东技术师范学院电子与信息学院,广州510665

出　　处：《北京邮电大学学报》2009年第5期104-108,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：广东省自然科学基金项目(5006102)

摘　　要：不分类的互联网协议(IP)地址方式无类别域间路由(CIDR)可以解决高端路由器中路由匹配延迟问题.通过对CIDR表深入分析,在参考数据库的非关键字索引方法和分割索引算法的基础上,提出了一种满足CIDR表要求的非关键字索引的B-Tree算法.该算法首先对CIDR表的全部前缀地址集合进行分割索引,分割后,CIDR表被改变成一种B-Tree索引结构;然后按照IP地址的非关键字对CIDR表进行快速查找.仿真结果表明,本文算法更好地满足了快速查找IP地址的需求.To solve the problem of route matching delay in the core routers,an unclassified Internet protocol（IP） address mode,classless inter-domain routing（CIDR）,is introduced.By analyzing the CIDR list and referring to the non-Keyword index method and the partitioned indexing algorithm in databases,a novel B-Tree algorithm with non-keyword index which satisfies the requirements of the CIDR list is brought forward.This algorithm firstly makes a partitioned index on the set of all the prefix addresses in the CIDR list according to the non-keywords of the IP addresses. Simulation shows that the new algorithm meets the demand for the IP address fast lookup.

关 键 词：高端路由器 无类别域间路由选择表 索引查找算法 

分 类 号：TN915.05[电子电信—通信与信息系统]