非结构化P2P 网络中基于节点的MQR 算法设计与实现

doi:10.3969/j.issn.1000-3428.2014.09.023

计算机工程

非结构化P2P 网络中基于节点的MQR 算法设计与实现

谢　晃¹,张　昱¹,王云凯²

(1. 中国科学技术大学软件学院,江苏苏州215123;2. 西南财经大学经济信息工程学院,成都611130)

收稿日期:2013-08-19 出版日期:2014-09-15 发布日期:2014-09-12
作者简介:谢　晃(1987 - ),男,硕士研究生,主研方向:对等网络,信息检索;张　昱,副教授、博士;王云凯,硕士研究生。

Design and Implementation of Node-based MQR Alogorithm in Unstructured P2P Networks

XIE Huang ¹,ZHANG Yu¹,WANG Yun-kai ²

(1. College of Software,University of Science and Technology of China,Suzhou 215123,China;2. College of Economic Information Engineering,Southwestern University of Finance and Economics,Chengdu 611130,China)

Received:2013-08-19 Online:2014-09-15 Published:2014-09-12

摘要/Abstract

摘要： 在非结构化P2P 搜索中,由于缺少全局性的管理机制,网络节点无法获得整个网络的拓扑结构及目标数据的定位信息,因此查询消息的路由过程具有较高的随机性,不仅查询性能低,而且宽带消耗大。为在有效控制网络冗余消息规模的同时提高数据的搜索范围,在分析现有2 类典型非结构化P2P 路由算法的基础上,提出一种基于节点的MQR 算法。利用网络节点的状态信息及搜索过程中查询消息的TTL 值状态信息,从数据的搜索范围与网络使用情况2 个方面来提高非结构化P2P 网络搜索性能。仿真实验结果表明,与传统的P2P 路由算法APS 和Random Walk 相比,该算法在搜索准确率、网络利用率及召回率方面有更好的表现。

关键词: 对等网络, 资源定位, 路由算法, 非结构化, MQR 算法

Abstract: Due to the lack of global governance mechanisms in the unstructured Peer-to-Peer(P2P) network,network nodes do not know the entire network topology and target data location information. So the query message routing process has a high randomness,not only query performance is low,but also bandwidth consumption is large. Based upon the analysis of two typical categories of unstructured P2P routing alogorithms,this paper proposes a node-based Mixed Query Routing(MQR) alogorithm to deal with the scale problem of redundant messages and to improve the search scope of data. By means of the status information about the nodes and the TTL values of the queries,it can improve the search performance both in the aspect of data’s search scope and network efficiency. Simulation experimental results show that compared with the typical alogorithms APS and Random Walk,the MQR alogorithm can reach higher accuracy rate,better network efficiency and recall rate.

Key words: Peer-to-Peer (P2P) network, resource location, routing alogorithm, unstructured, Mixed Query Routing (MQR) alogorithm

中图分类号:

TP393. 02

谢晃,张昱,王云凯. 非结构化P2P 网络中基于节点的MQR 算法设计与实现[J]. 计算机工程, doi: 10.3969/j.issn.1000-3428.2014.09.023.

XIE Huang,ZHANG Yu,WANG Yun-kai. Design and Implementation of Node-based MQR Alogorithm in Unstructured P2P Networks[J]. Computer Engineering, doi: 10.3969/j.issn.1000-3428.2014.09.023.

http://www.ecice06.com/CN/Y2014/V40/I9/111

参考文献

参考文献 [ 1 ]　方启明,杨广文,武永卫,等. 基于P2P 的Web 搜索技术[J]. 软件学报,2008,19(10):2706-2719. [ 2 ]　徐　玉. P2P 网络中资源搜索算法的研究[D]. 南京: 南京邮电大学,2011. [ 3 ]　Jiang Hongbo, Jin Shudong. Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peerto- Peer Networks [ C ] / / Proc. of the 13th IEEE International Conference on Network Protocols. [S. l. ]: IEEE Press,2005. [ 4 ]　Kalogeraki V,Gunopulos D,Zeinalipouryazti D. A Local Search Mechanism for Peer-to-Peer Networks [ C ] / / Proc. of the 11th International Conference on Information and Knowledge Management. New York, USA: ACM Press,2002:300-307. [ 5 ]　Yang B,GarciaMolina H. Improving Search in Peer-to- Peer Networks [ C ] / / Proc. of the 22nd International Conference on Distributed Computing Systems. [S. l. ]: IEEE Press,2002:5-14. [ 6 ]　Gkantsidis C,Mihail M,Saberi A. RandomWalks on Peerto- Peer Networks [C] / / Proc. of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies. [S. l. ]:IEEE Press,2004:241-263. [ 7 ]　Tsoumakos D, Roussopoulos N, Adaptive Probabilistic Search for Peer-to-Peer Networks[C] / / Proc. of the 3rd International Conference on Peer-to-Peer Computing. [S. l. ]:IEEE Press,2003:102-109. [ 8 ]　Michlmayr E. Ant Alogorithms for Search in Unstructured Peer-to-Peer Networks [C] / / Proc. of the 22nd International Conference on Data Engineering Workshops. [S. l. ]:IEEE Press,2006. [ 9 ]　Sripanidkulchai K, Maggs B, Zhang Hui. Efficient Content Location Using Interest-based Locality in Peerto- Peer Systems [C] / / Proc. of the 22nd Annual Joint Conference of IEEE Computer and Communications. [S. l. ]:IEEE Societies,2003:2166-2176. [10]　Akavipat R, Wu Le, Menczer F, et al. Emerging Semantic Communities in Peer Web Search[C] / / Proc. of International Workshop on Information Retrieval in Peer-to-Peer Networks. [S. l. ]:ACM Press,2006:1-8. [11]　Bisnik N, Abouzeid A A. OptimizingRandom Walk Search Alogorithms in P2P Networks [ J ]. Computer Networks,2007,51(6):1499-1514. (下转第123 页) (上接第116 页) [12]　Lv Qin,Cao Pei,Cohen E,et al. Search and Replication in Unstructured Peer-to-Peer Networks[C] / / Proc. of the 16th International Conference on Supercomputing. [S. l. ]:ACM Press,2002:84-95. [13]　Sripanidkulchai K. The Popularity of Gnutella Queries and Its Implications on Scalability[EB / OL]. (2001-02- 11). http:/ / www. openp2p. com. [14]　Almeida V,Bestavros A,Crovella M,et al. Characterizing Reference Locality in the WWW[C] / / Proc. of the 4th International Conference on Parallel and Distributed Information Systems. [S. l. ]:IEEE Press,1996:92-103. [15]　Gummadi P K,Saroiu S,Gribble S D. A Measurement Study of Peer-to-Peer File Sharing Systems [J]. ACM SIGCOMM Computer Communication Review,2002,32 (1):82-96. 编辑　任吉慧 123

[1]	黎浩民, 李光平. 基于稀疏神经网络的图像超分辨率重建算法[J]. 计算机工程, 2022, 48(7): 247-253.
[2]	王文欣, 贺煜航, 陈刚. 基于EM路由算法的医学图像分割UCaps网络[J]. 计算机工程, 2022, 48(2): 268-274.
[3]	刘博阳, 胡舒凯, 施得君, 卢宏生. VTFTR：高维胖树中的无死锁容错路由算法[J]. 计算机工程, 2022, 48(12): 38-44,53.
[4]	缪祎晟, 赵春江, 吴华瑞. 基于改进粒子群的农田WSN路由优化方法[J]. 计算机工程, 2022, 48(10): 218-223.
[5]	陈辉, 高岩. 基于双簇头的WSNs非均匀分簇路由算法[J]. 计算机工程, 2022, 48(10): 184-192.
[6]	潘成胜, 梁芷铭, 石怀峰, 孔志翔. 面向并发业务的卫星网络服务功能链优化算法[J]. 计算机工程, 2021, 47(3): 196-201.
[7]	谢勇盛, 杨余旺, 邱修林, 王吟吟. 基于函数逼近的强化学习FANET路由优化算法[J]. 计算机工程, 2021, 47(11): 207-213.
[8]	李翠然, 李昂. 太阳能补给的线型WSN能量高效路由算法[J]. 计算机工程, 2020, 46(9): 178-185.
[9]	张泰江, 李勇军, 赵尚弘. 基于GEO/LEO双层卫星网络的路由算法优化设计[J]. 计算机工程, 2020, 46(7): 198-205.
[10]	李洪兵, 刘子路, 陈强, 刘莎, 刘小龙, 梁裕巧, 杨震, 陈立万. 基于分级邻近节点的无线传感器网络分簇路由算法[J]. 计算机工程, 2020, 46(6): 187-195.
[11]	孙泽宇, 阎奔, 聂雅琳, 刘保罗, 贾馥谦, 来纯晓. 一种带有可控阈值参数的分簇路由优化算法[J]. 计算机工程, 2020, 46(3): 184-191.
[12]	杨力, 戚耀文, 潘成胜. 基于SDN的异构空间信息网络传输策略[J]. 计算机工程, 2019, 45(7): 71-77,85.
[13]	张步硕,吕娜,陈柯帆,曹芳波,刘创. 面向航空集群网络的低时延高可靠路由算法[J]. 计算机工程, 2018, 44(9): 89-94,100.
[14]	翟永,李宁,王晓飞. 基于带宽利用率的指数函数调制路由算法[J]. 计算机工程, 2018, 44(6): 93-99,103.
[15]	王夫沭,李建波,宋有美,陆芳,许殿磊. 基于历史与位置信息的容迟网络路由算法[J]. 计算机工程, 2018, 44(4): 89-97.

选择文件类型/文献管理软件名称

选择包含的内容

非结构化P2P 网络中基于节点的MQR 算法设计与实现

Design and Implementation of Node-based MQR Alogorithm in Unstructured P2P Networks

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

模态框（Modal）标题

选择文件类型/文献管理软件名称

选择包含的内容

非结构化P2P 网络中基于节点的MQR 算法设计与实现

Design and Implementation of Node-based MQR Alogorithm in Unstructured P2P Networks

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价