Computer Science ›› 2020, Vol. 47 ›› Issue (2): 221-226.doi: 10.11896/jsjkx.190400002

• Computer Network • Previous Articles     Next Articles

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.

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

CLC Number: 

  • 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.
[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] FAN Jing-yu, LIU Quan. Off-policy Maximum Entropy Deep Reinforcement Learning Algorithm Based on RandomlyWeighted Triple Q -Learning [J]. Computer Science, 2022, 49(6): 335-341.
[2] ZHOU Qin, LUO Fei, DING Wei-chao, GU Chun-hua, ZHENG Shuai. Double Speedy Q-Learning Based on Successive Over Relaxation [J]. Computer Science, 2022, 49(3): 239-245.
[3] GENG Hai-jun, WANG Wei, YIN Xia. Single Node Failure Routing Protection Algorithm Based on Hybrid Software Defined Networks [J]. Computer Science, 2022, 49(2): 329-335.
[4] LIU Ling-yun, QIAN Hui, XING Hong-jie, DONG Chun-ru, ZHANG Feng. Incremental Classification Model Based on Q-learning Algorithm [J]. Computer Science, 2020, 47(8): 171-177.
[5] CAO Su-e, YANG Ze-min. Prediction of Wireless Network Traffic Based on Clustering Analysis and Optimized Support Vector Machine [J]. Computer Science, 2020, 47(8): 319-322.
[6] ZHENG Shuai, LUO Fei, GU Chun-hua, DING Wei-chao, LU Hai-feng. Improved Speedy Q-learning Algorithm Based on Double Estimator [J]. Computer Science, 2020, 47(7): 179-185.
[7] LU Hai-feng, GU Chun-hua, LUO Fei, DING Wei-chao, YUAN Ye, REN Qiang. Virtual Machine Placement Strategy with Energy Consumption Optimization under Reinforcement Learning [J]. Computer Science, 2019, 46(9): 291-297.
[8] YUAN Yuan, ZHENG Jia-li, SHI Jing, WANG Zhe, LI Li. Anti-collision Algorithm Based on Q-learning for RFID Multiple Readers [J]. Computer Science, 2019, 46(6): 124-127.
[9] LIANG Yuan, YUAN Jing-ling, CHEN Min-cheng. Prefetching Algorithm of Sarsa Learning Based on Space Optimization [J]. Computer Science, 2019, 46(3): 327-331.
[10] LI Min-shuo, YAO Ming-hai. Q-learning with Feature-based Approximation for Traffic Light Control [J]. Computer Science, 2018, 45(11A): 143-145.
[11] SHI Yun-fang,WU Dong-ying,LIU Sheng-li and GAO Xiang. Research on DDoS Attack-defense Game Model Based on Q-learning [J]. Computer Science, 2014, 41(11): 203-207.
[12] . Research on Q Learning Algorithm with Sharing Experience in Learning Process [J]. Computer Science, 2012, 39(5): 213-216.
[13] LIU Yu-lei,QIN Xiao-lin,SHEN Jia-jia. Grid-based K Nearest Neighbor Query Processing Algorithm in Wireless Sensor Networks [J]. Computer Science, 2011, 38(5): 31-36.
[14] WANG Ping,QIU Jing,QIU Yu-hui. Trust Computing Based on Probability Theory in Unstructured P2P Network [J]. Computer Science, 2010, 37(2): 212-215.
[15] YU Dong-mei FANG Jian-an (School of Information Science and Technology, Donghua Unviversity, Shanghai 201620,China). [J]. Computer Science, 2008, 35(5): 172-173.
Full text



No Suggested Reading articles found!