An Adaptive K-random Walks Method for Peer-to-Peer Networks

Designing an intelligent search method in peer-to-peer networks will significantly affect efficiency of the network taking into account sending a search query to nodes which have more probably stored the desired object. Machine learning techniques such as learning automaton can be used as an appropriate tool for this purpose. This paper tries to present a search method based on the learning automaton for the peer-to-peer networks, in which each node is selected according to values stored in its memory for sending the search queries rather than being selected randomly. The probable values are stored in tables and they indicate history of the node in previous searches for finding the desired object. For evaluation, simulation is used to demonstrate that the proposed algorithm outperforms K-random walk method which randomly sends the search queries to the nodes.

[1]  Sabu M. Thampi,et al.  Collaborative Load Balancing Scheme for Improving Search Performance in Unstructured P 2 P Networks , 2008 .

[2]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[3]  Sabu M. Thampi,et al.  Survey of Search and Replication Schemes in Unstructured P2p Networks , 2010, Netw. Protoc. Algorithms.

[4]  Sabu M. Thampi,et al.  An Effective Distributed Search Technique for Unstructured Peer-to-Peer Networks , 2008 .

[5]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .

[6]  Richard S. Sutton,et al.  This Excerpt from Reinforcement Learning. Introduction 1.2 Examples 1.3 Elements of Reinforcement Learning 1.3 Elements of Reinforcement Learning , .

[7]  Dimitrios Tsoumakos,et al.  Probabilistic Knowledge Discovery and Management for P 2 P Networks , 2003 .

[8]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

[9]  Dimitrios Tsoumakos,et al.  Analysis and comparison of P2P search methods , 2006, InfoScale '06.

[10]  Kaddour Najim,et al.  Learning Automata: Theory and Applications , 1994 .

[11]  Alireza Bagheri,et al.  An Adaptive Architecture for Personalized Search ?Engine in Ubiquitous Environment with Peer to Peer Systems , 2009, 2009 International Conference on Information and Multimedia Technology.

[12]  Mohammad Reza Meybodi,et al.  A Novel Learning-based Search Algorithm for Unstructured Peer to Peer Networks , 2013 .

[13]  Mohammad Reza Meybodi,et al.  A new version of k-random walks algorithm in peer-to-peer networks utilizing learning automata , 2013, The 5th Conference on Information and Knowledge Technology.

[14]  Mohammad Reza Meybodi,et al.  A novel self-adaptive search algorithm for unstructured peer-to-peer networks utilizing learning automata , 2013, 2013 3rd Joint Conference of AI & Robotics and 5th RoboCup Iran Open International Symposium.

[15]  Mance E. Harmon,et al.  Reinforcement Learning: A Tutorial. , 1997 .

[16]  Mahdi Ghorbani,et al.  ISA: An Intelligent Search Algorithm for Peer-to-Peer Networks , 2013, ICACNI.

[17]  Alejandro López-Ortiz,et al.  Search Algorithms for Unstructured Peer-to-Peer Networks , 2007, 32nd IEEE Conference on Local Computer Networks (LCN 2007).

[18]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[19]  Dimitrios Tsoumakos,et al.  Adaptive probabilistic search for peer-to-peer networks , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[20]  Alireza Bagheri,et al.  Enhance your search engine functionality with peer to peer systems , 2010, 2010 The 2nd International Conference on Computer and Automation Engineering (ICCAE).

[21]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.