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

doi:10.3969/j.issn.1006-2475.2014.12.019

计算机与现代化

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

(江苏建筑职业技术学院，江苏徐州 221116)

收稿日期:2014-09-09 出版日期:2014-12-22 发布日期:2014-12-22
作者简介:冯庆华(1970-)，男，江苏扬州人，江苏建筑职业技术学院实验师，硕士，研究方向：计算机网络与安全。

Routing Lookup Algorithm Based on Improved Hash Coding

(Jiangsu Jianzhu Institute, Xuzhou 221116, China)

Received:2014-09-09 Online:2014-12-22 Published:2014-12-22

摘要/Abstract

摘要： 路由查找算法是网络路由器关键技术之一，为了提高数据查询性能，提出一种基于改进哈希编码的路由查询匹配算法。利用哈希函数压缩数据名字，采用状态转换阵列实现名称最长前缀的快速匹配，将路由节点缓存因素引入路由决策，采用仿真对比实验对算法的性能进行测试。结果表明，与其它路由查询匹配算法相比，本文算法不仅降低了数据内存开销，大幅度减少平均查询时间，而且提高了数据路由查询的效率。

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

Abstract: The routing lookup algorithm is one of the key technologies in network routers. In order to improve the efficiency of data 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 routing node cache factors are introduced into the routing decision, finally the simulation experiments are carried out to test the performance of this algorithm. The results show that, compared with other data routing lookup query matching algorithms, the proposed algorithm not only reduces the cost of data memory, greatly reduces the average routing lookup time, and improves the efficiency of data routing lookup.

Key words: named data network, hash coding, routing lookup, neighbor cache explore routing strategy

中图分类号:

TP393

冯庆华. 基于改进哈希编码的路由查询匹配算法[J]. 计算机与现代化, doi: 10.3969/j.issn.1006-2475.2014.12.019.

FENG Qing-hua. Routing Lookup Algorithm Based on Improved Hash Coding[J]. Computer and Modernization, doi: 10.3969/j.issn.1006-2475.2014.12.019.

参考文献

[1] Pallis G, Vakali A. Insight and perspectives for content delivery networks[J]. Communications of the ACM, 2006,49(1):101-106.

[2] 唐晖,周旭,韩言妮,等. 以内容为中心的下一代宽带网络演进[J]. 信息通信技术, 2011,5(4):38-43.

[3] 林啸. 以内容为中心的新一代互联网体系架构研究[J]. 电信科学, 2010,26(5):1-7.

[4] 唐明董,张国清,杨景,等. 互联网可扩展路由[J]. 软件学报, 2010,21(10):2524-2541.

[5] Zhang Lixia, Estrin D, Burke J, et al. Named Data Networking (NDN) Project[R]. Technical Report NDN-0001, Aiken, USA: PARC, 2010.

[6] Jacobson V, Smetters D K, Briggs N H, et al. VoCCN: Voice-over content-centric networks[C]// Proceedings of the 2009 Workshop on Re-architecting the Internet. 2009.

[7] Zhou Zhou, Song Tian, Jia Yunde. A high-performance URL lookup engine for URL filtering systems[C]// Proceedings of the 2010 IEEE International Conference on Communications (ICC). 2010.

[8] Michel B S, Nikoloudakis K, Reiher P, et al. URL forwarding and compression in adaptive Web caching[C]// Proceedings of the 9th IEEE Annual Joint Conference on INFOCOM. 2000,2:670-678.

[9] Prodanoff Z G, Christensen K J. Managing routing tables for URL routers in content distribution networks[J]. International Journal of Network Management, 2004,14(3):177-192.

[10] Yu Yifan, Gu Daqing. The resource efficient forwarding in the content centric network[C]// Proceedings of the 10th International IFIP TC 6 Networking Conference. 2011:66-77.

[11] Singla A, Godfrey P, Fall K, et al. Scalable routing on flat names[C]// Proceedings of the 6th International Conference (Co-NEXT ’10). 2010:20-25.

[12] Jain S, Chen Yingying, Zhang Zhili, et al. VIRO: A scalable, robust and namespace independent virtual ID routing for future networks[C]// Proceedings of the 2011 IEEE INFOCOM. 2011:2381-2389.

[13] Park C, Hwang S. Fast URL lookup using URL prefix hash tree[J]. Journal of KIISE, 2008,35(5):67-75.

[14] 王道谊,周文安,刘元安. 内容分发网络中内容流行度集中性的研究[J]. 计算机工程与应用, 2011,47(6):102-104.

[15] 叶润生,徐明伟. 命名数据网络中的邻居缓存路由策略[J]. 计算机科学与探索, 2012,6(7):593-601.

[16] 叶润生,徐明伟. NDN邻居缓存路由策略[J]. 计算机科学与探索, 2012,6(0):1-10.

[17] Chlebus E, Brazier J. Nonstationary Poisson modeling of Web browsing session arrivals[J]. Information Processing Letters, 2007,102(5):187-190.

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

Routing Lookup Algorithm Based on Improved Hash Coding

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 2

编辑推荐

Metrics

本文评价

[1]	樊娜, 邹小敏, 李思瑞, 杨晓朵. 基于信任计算的车载命名数据网络安全机制[J]. 计算机与现代化, 2023, 0(02): 96-103.
[2]	杨昊, 高全力, 李雪花, 赵辉, 金帅, 徐国梁. 基于缓存价值的命名数据网络缓存优化策略[J]. 计算机与现代化, 2022, 0(10): 95-99.