期刊文献+

Deep Q-Learning Based Optimal Query Routing Approach for Unstructured P2P Network 被引量:1

下载PDF
导出
摘要 Deep Reinforcement Learning(DRL)is a class of Machine Learning(ML)that combines Deep Learning with Reinforcement Learning and provides a framework by which a system can learn from its previous actions in an environment to select its efforts in the future efficiently.DRL has been used in many application fields,including games,robots,networks,etc.for creating autonomous systems that improve themselves with experience.It is well acknowledged that DRL is well suited to solve optimization problems in distributed systems in general and network routing especially.Therefore,a novel query routing approach called Deep Reinforcement Learning based Route Selection(DRLRS)is proposed for unstructured P2P networks based on a Deep Q-Learning algorithm.The main objective of this approach is to achieve better retrieval effectiveness with reduced searching cost by less number of connected peers,exchangedmessages,and reduced time.The simulation results shows a significantly improve searching a resource with compression to k-Random Walker and Directed BFS.Here,retrieval effectiveness,search cost in terms of connected peers,and average overhead are 1.28,106,149,respectively.
出处 《Computers, Materials & Continua》 SCIE EI 2022年第3期5765-5781,共17页 计算机、材料和连续体(英文)
基金 Authors would like to thank the Deanship of Scientific Research at Shaqra University for supporting this work under Project No.g01/n04.
  • 相关文献

参考文献2

二级参考文献27

  • 1Risson J,Moors T.Survey of research towards robust peer-to-peer networks:search methods.Computer Networks,2006,50(17):3485-3521.
  • 2Yang B,Garcia-Molina H.Improving search in peer-to-pear networks.Proceedings of the 22nd International Conference on Distributed Computing Systems(ICDCS'02),Jul 2-5,2002,Vienna,Austria.Piscataway,NJ,USA:IEEE,2002:5-14.
  • 3Lü Q,Cao P,Cohen E.Search and replication in unstructured peer-to-peer networks.Proceedings of the 16th International Conference on Supercomputing(ICS'02),Jun 22-26,New York,NY,USA.New York,NY,USA:ACM,2002:84-95.
  • 4Cohen E,Kaplan H,Fiat A.Associative search in peer to peer networks:Harnessing latent semantics.Proceedings of the IEEE 22nd Annual Joint Conference of the IEEE Computer and Communications Societies(INFOCOM'03):Vol 2,Mar 30-Apr 3,2003,San Francisco,CA,USA.Piscataway,NJ,USA:IEEE,2003:1261-1271.
  • 5Spripanidkulchai K,Maggs B,Zhang H.Efficient content location using Interest-based locality in peer-to-peer systems.Proceedings of the IEEE 22nd Annual Joint Conference of the IEEE Computer and Communications Societies(INFOCOM'03):Vol 3,Mar 30-Apr 3,2003,San Francisco,CA,USA.Piscataway,NJ,USA:IEEE,2003:2166-2176.
  • 6Bawa M,Manku G,Raghavan P.SETS:Search enhanced by topic segmentation.Proceedings of the Annual ACM Conference on Research and Development in Information Retrieval(SIGIR'03),Jul 28-Aug 1,2003,Toronto,Canada.New York,NY,USA:ACM,2003:306-313.
  • 7Ratnasamy S,Francis P,Handley M,et al.A scalable content addressable network.Proceedings of the International Conference of the Special Interest Group on Data Communication(SIGCOMM'01),Aug 27-31,2001,San Diego,CA,USA.New York,NY,USA:ACM,2001:161-172.
  • 8Rowstron A,Druschel P.Pastry:scalable,distributed object location and routing for large-scale peer-to-peer systems.Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms(Middleware'01),Nov 12-16,2001,Heidelberg,Germany.LNCS 2218.Berlin,Germany:Springer-Vorlag,2001:329-350.
  • 9Stoica I,Morris R,Karger D,et al.Chord:a scalable peer-to-peer lookup protocol for internet applications.IEEE/ACM Transactions on Networking,2003,11(1):17-32.
  • 10Crespo A,Garcia-Molina H.Routing indices for peer-to-peer systems.Proceedings of the 22nd International Conference on Distributed Computing Systems(ICDCS'02),Jul 2-5,2002,Vienna,Austria.Piscataway,NJ,USA:IEEE,2002:23-30.

共引文献4

同被引文献5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部