基于改进哈希编码的路由查询匹配算法  

Routing Lookup Algorithm Based on Improved Hash Coding

作　　者：冯庆华[1] 

机构地区：[1]江苏建筑职业技术学院,江苏徐州221116

出　　处：《计算机与现代化》2014年第12期87-90,102,共5页Computer and Modernization

摘　　要：路由查找算法是网络路由器关键技术之一,为了提高数据查询性能,提出一种基于改进哈希编码的路由查询匹配算法。利用哈希函数压缩数据名字,采用状态转换阵列实现名称最长前缀的快速匹配,将路由节点缓存因素引入路由决策,采用仿真对比实验对算法的性能进行测试。结果表明,与其它路由查询匹配算法相比,本文算法不仅降低了数据内存开销,大幅度减少平均查询时间,而且提高了数据路由查询的效率。The routing lookup algorithm is one of the key technologies in network routers .In order to improve the efficiency of da-ta routing lookup , a data routing lookup query matching algorithm is proposed based on the improved hash coding .Hash function is used to compress the data name , and the state switching array is used to match the longest prefix name quickly , and then rou-ting node cache factors are introduced into the routing decision , finally the simulation experiments are carried out to test the per-formance of this algorithm .The results show that , compared with other data routing lookup query matching algorithms , the pro-posed algorithm not only reduces the cost of data memory , greatly reduces the average routing lookup time , and improves the effi-ciency of data routing lookup .

关 键 词：命名数据网络 哈希编码 路由查询 邻居缓存路由策略 

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