计算机科学 ›› 2020, Vol. 47 ›› Issue (2): 221-226.doi: 10.11896/jsjkx.190400002

• 计算机网络 • 上一篇    下一篇

基于节点兴趣和Q-learning的P2P网络搜索机制

李龙飞,张泾周,王鹏德,郭鹏军   

  1. (西北工业大学自动化学院 西安710129)
  • 收稿日期:2019-03-29 出版日期:2020-02-15 发布日期:2020-03-18
  • 通讯作者: 张泾周(bme@nwpu.edu.cn)

P2P Network Search Mechanism Based on Node Interest and Q-learning

LI Long-fei,ZHANG Jing-zhou,WANG Peng-de,GUO Peng-jun   

  1. (School of Automation,Northwest Polytechnic University,Xi’an 710129,China)
  • Received:2019-03-29 Online:2020-02-15 Published:2020-03-18
  • About author:LI Long-fei,born in 1992,master.His main research interests include computer network,machine learning and block chain;ZHANG Jing-zhou,born in 1960,professor,master supervisor.His main research interests include computer network,computer control and intelligent control,computer measurement and control technology.

摘要: 将智能手机设备加入基于非结构化P2P网络的资源共享系统中能够满足人们对资源共享的多样化、便利性、高频性、实时性、高效性等要求,但是该系统网络规模的扩张和网络节点互异性的加大,必将导致系统资源搜索效率的降低、冗余信息的剧增以及网络更加不稳定。为了解决这些问题,文中设计了一种改进的基于节点兴趣和Q-learning的资源搜索机制。首先将节点根据兴趣相似度进行兴趣聚类,划分兴趣集,然后根据兴趣集中节点的能力值构建兴趣树,该结构避免了消息环路的产生,极大地降低了冗余信息;在资源搜索中,兴趣树内采用洪泛算法转发消息,兴趣树之间采用基于Q-learning的消息转发机制,不断强化最可能获取目标资源的路径,查询消息优先在这些路径上传播。另外,针对“热点”资源问题,设计了自适应热点资源索引机制,减少了重复路径搜索,进一步减少了冗余消息量;针对节点失效的问题,给出了根节点冗余机制和捎带检测的策略方法,分别解决了根节点失效和普通节点失效导致的兴趣树的不完整性问题,分析表明该方法能够减少消息冗余量。仿真实验结果表明,与GBI-BI算法和Interest CN算法相比,所提搜索算法能够提高命中率,缩短响应时间,减少冗余信息,具有较好的综合性能,最终解决了由于智能手机设备加入P2P网络导致的资源搜索效率下降、网络流量开销大的问题。

关键词: Q-learning, 非结构化P2P网络, 节点失效, 节点兴趣, 搜索算法

Abstract: Adding smartphone devices to the resource sharing system based on unstructured P2P network can satisfy people’s requirements for diversity,convenience,high frequency,real-time and high efficiency of resource sharing.However,the expansion of network scale and the increase of network node heterogeneity will inevitably lead to the decrease of system resource search efficiency,the sharp increase of redundant information and the more non-network.To solve these problems,an improved resource search mechanism based on node interest and Q-learning was designed.Firstly,nodes are clustered according to interest similarity,and interest sets are divided.Then,interest trees are constructed according to the capability values of interest sets.This structure avoids the generation of message loops,which greatly reduces redundant information.In resource search,flooding algorithm is used to forward messages in interest trees,and Q-learning-based message forwarding mechanism is used among interest trees,which is constantly strengthened.The most likely paths to obtain the target resources are transformed,and query messages are propagated preferentially on these paths.In addition,for the “hot spot” resource problem,an adaptive hot spot resource index mechanism was designed to reduce the repeated path searching and redundant message volume.To solve the problem of node failure,the root node redundancy mechanism and the strategy method of piggyback detection were given.The analysis results show that the method can reduce message redundancy caused by root node failure and common node failure respectively.The simulation results show that compared with GBI-BI algorithm and Interest CN algorithm,the proposed search algorithm can improve hit rate,shorten response time,reduce redundant information,and has better comprehensive performance.Finally,it solves the problems of low efficiency of resource search and high overhead of network traffic caused by the addition of smartphone devices to P2P network.

Key words: Node failure, Node interest, Q-learning, Search algorithms, Unstructured P2P network

中图分类号: 

  • TP393
[1]BAIDARI,ISHWAR,HANAGAWADIMATH,et al.Traversingdirected cyclic and acyclic graphs using modified BFS algorithm[C]∥2014 Science and Information Conference London.2014:175-181.
[2]CAI K.Survey of search and optimization of P2P networks[J].Peer-To-Peer Networking and Applications,2011,4(3):211-218.
[3]MA W M,MENG X W,ZHANG Y J.Bidirectional random walk search mechanism for unstructured P2P network[J].Journal of Software,2012,23(4):894-911.
[4]YE P S.Improved Search Algorithm for Unstructured P2P Network[J].Computer and Modernization,2013,12:44-47.
[5]LU W,ZHOU T,XING W W.An Improved Flooding Based Search Mechanism in Unstructured P2P Network[J].Journal of Northwestern Polytechnical University,2015,33(2):342-350.
[6]WANG X S,XING D,LI G.Enhanced Probabilistic-based Search for Unstructured Peer-to-Peer Networks[J].Computer Simulation,2008,25(9):118-121.
[7]ZHUANG L,DONG X G,CHANG Y C.Divisional s earching strategy based on degree in unstructured P2P networks[J].Journal of Computer Applications,2008,28(3):549-552.
[8]TU Z Y,ZENG X.Study on pheromone update mechanism of unstructured P2P network resources searching based on ant colony algorithm[J].Journal of Nanchang Institute of Technology,2016,35(1):66-69.
[9]DUAN Z H,TIAN C,ZHOU M C,et al.Two-layer hybrid peer-to-peer networks[J].Peer-to-Peer Networking and Applications,2017,10(6):1304-1322.
[10]XU S.Improved mechanism of unstructuredP2P network topology structure[J].Computer Engineering and Applications,2009,45(10):110-112.
[11]ZHAO X H,FENG X W,SHI Y B.P2P Network Topological Based on Interest Domain with Central Node[J].Science Technology and Engineering,2011,11(21):5228-5231.
[12]WU X J,ZHANG Y M.Topology research of unstructured P2P network based on node ofinterest[J].Computer Engineering and Applications,2016,52(9):102-107.
[13]HE Q,LIU D,ZHOU M.Research on algorithm for low bandwidth super-peers network based on user’s behavior characte-ristic[J].Computer Engineering and Applications,2013,49(11):61-65.
[14]THEODORIDIS S,KOUTROUMBAS K.Pattern recognition.
[M].北京:电子工业出版社,2016:280-286.
[15]SHEN X J,CHANG Q,GOU J P,et al.Collaborative Q-Lear-ning Based Routing Control in Unstructured P2P Networks[J].Lecture Notes in Computer Science,2016,9516:910-921.
[16]SABU M,THAMPI,CHANDRA S K.Q-learning based colla-borative load balancing using distributed search for unstructured P2P networks[C]∥2008 33rd IEEE Conference on Local Computer Networks.2008:797-802.
[17]LIU H L,CHEN G X,WU S Y.Improved resource search stra-tegy using Q-learning based onnode reputation for P2P network[J].Journal of Chongqing University of Posts and Telecommunications,2013,25(6):801-806.
[18]LIU H L,CHEN G X,CHEN Y,et al.A trust-based P2P resource search method integrating with Q-learning for future Internet[J].Peer-to-Peer Networking and Applications,2015,8(3):532-542.
[1] 唐枫, 冯翔, 虞慧群.
基于自适应知识迁移与资源分配的多任务协同优化算法
Multi-task Cooperative Optimization Algorithm Based on Adaptive Knowledge Transfer andResource Allocation
计算机科学, 2022, 49(7): 254-262. https://doi.org/10.11896/jsjkx.210600184
[2] 单晓英, 任迎春.
基于改进麻雀搜索优化支持向量机的渔船捕捞方式识别
Fishing Type Identification of Marine Fishing Vessels Based on Support Vector Machine Optimized by Improved Sparrow Search Algorithm
计算机科学, 2022, 49(6A): 211-216. https://doi.org/10.11896/jsjkx.220300216
[3] 李丹丹, 吴宇翔, 朱聪聪, 李仲康.
基于多种改进策略的改进麻雀搜索算法
Improved Sparrow Search Algorithm Based on A Variety of Improved Strategies
计算机科学, 2022, 49(6A): 217-222. https://doi.org/10.11896/jsjkx.210700032
[4] 田真真, 蒋维, 郑炳旭, 孟利民.
基于服务器集群的负载均衡优化调度算法
Load Balancing Optimization Scheduling Algorithm Based on Server Cluster
计算机科学, 2022, 49(6A): 639-644. https://doi.org/10.11896/jsjkx.210800071
[5] 严磊, 张功萱, 王添, 寇小勇, 王国洪.
混合云下具有交付期约束的众包任务调度算法
Scheduling Algorithm for Bag-of-Tasks with Due Date Constraints on Hybrid Clouds
计算机科学, 2022, 49(5): 244-249. https://doi.org/10.11896/jsjkx.210300120
[6] 周琴, 罗飞, 丁炜超, 顾春华, 郑帅.
基于逐次超松弛技术的Double Speedy Q-Learning算法
Double Speedy Q-Learning Based on Successive Over Relaxation
计算机科学, 2022, 49(3): 239-245. https://doi.org/10.11896/jsjkx.201200173
[7] 江妍, 马瑜, 梁远哲, 王原, 李光昊, 马鼎.
基于分数阶麻雀搜索优化OTSU肺组织分割算法
Lung Tissue Segmentation Algorithm:Fractional Order Sparrow Search Optimization for OTSU
计算机科学, 2021, 48(6A): 28-32. https://doi.org/10.11896/jsjkx.200900176
[8] 林忠甫, 颜力, 黄伟, 李洁.
基于参数自适应策略的改进乌鸦搜索算法
Improved Crow Search Algorithm Based on Parameter Adaptive Strategy
计算机科学, 2021, 48(6A): 260-263. https://doi.org/10.11896/jsjkx.201100158
[9] 曹素娥, 杨泽民.
基于聚类分析算法和优化支持向量机的无线网络流量预测
Prediction of Wireless Network Traffic Based on Clustering Analysis and Optimized Support Vector Machine
计算机科学, 2020, 47(8): 319-322. https://doi.org/10.11896/jsjkx.190800075
[10] 郑帅, 罗飞, 顾春华, 丁炜超, 卢海峰.
基于双估计器的改进Speedy Q-learning算法
Improved Speedy Q-learning Algorithm Based on Double Estimator
计算机科学, 2020, 47(7): 179-185. https://doi.org/10.11896/jsjkx.190500143
[11] 贾吾财, 吕光宏, 王桂芝, 宋元隆.
SDN多控制器放置问题研究综述
Review on Placement of Multiple Controllers in SDN
计算机科学, 2020, 47(7): 206-212. https://doi.org/10.11896/jsjkx.200200075
[12] 唐承娥, 韦军.
改进的支持向量回归机在电力负荷预测中的应用
Application of Power Load Prediction Based on Improved Support Vector Regression Machine
计算机科学, 2020, 47(6A): 58-65. https://doi.org/10.11896/JsJkx.191000042
[13] 曹义亲, 段也钰, 武丹.
基于WFSOA的2D-Otsu钢轨缺陷图像分割方法
2D-Otsu Rail Defect Image Segmentation Method Based on WFSOA
计算机科学, 2020, 47(5): 154-160. https://doi.org/10.11896/jsjkx.190200295
[14] 陈玉涛, 许文超, 赵召娜, 刘洪恩, 王浩.
面向通用航空器运行排班及维修的策略优化
Optimization of Scheduling and Maintenance Strategy for Navigation Aircraft Operation
计算机科学, 2020, 47(11A): 632-637. https://doi.org/10.11896/jsjkx.200600053
[15] 李煜,尚志勇,刘景森.
求解函数优化问题的改进布谷鸟搜索算法
Improved Cuckoo Search Algorithm for Function Optimization Problems
计算机科学, 2020, 47(1): 219-230. https://doi.org/10.11896/jsjkx.181102165
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!