A distributed resource discovery algorithm for P2P grids

Centralized or hierarchical administration of the classical grid resource discovery approaches is unable to efficiently manage the highly dynamic large-scale grid environments. Peer-to-peer (P2P) overlay represents a dynamic, scalable, and decentralized prospect of the grids. Structured P2P methods do not fully support the multi-attribute range queries and unstructured P2P resource discovery methods suffer from the network-wide broadcast storm problem. In this paper, a decentralized learning automata-based resource discovery algorithm is proposed for large-scale P2P grids. The proposed method supports the multi-attribute range queries and forwards the resource queries through the shortest path ending at the grid peers more likely having the requested resource. Several simulation experiments are conducted to show the efficiency of the proposed algorithm. Numerical results reveal the superiority of the proposed model over the other methods in terms of the average hop count, average hit ratio, and control message overhead.

[1]  Domenico Talia,et al.  A super-peer model for resource discovery services in large-scale Grids , 2005, Future Gener. Comput. Syst..

[2]  Mohammad Reza Meybodi,et al.  A link stability-based multicast routing protocol for wireless mobile ad hoc networks , 2011, J. Netw. Comput. Appl..

[3]  Salvatore Orlando,et al.  Resource Discovery in a Dynamic Grid Environment , 2005, 16th International Workshop on Database and Expert Systems Applications (DEXA'05).

[4]  Min Cai,et al.  MAAN: A Multi-Attribute Addressable Network for Grid Information Services , 2003, Journal of Grid Computing.

[5]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[6]  B. R. Harita,et al.  Learning automata with changing number of actions , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Domenico Talia,et al.  Peer-to-Peer resource discovery in Grids: Models and systems , 2007, Future Gener. Comput. Syst..

[8]  Fabrizio Silvestri,et al.  A Grid Information Service Based on Peer-to-Peer , 2005, Euro-Par.

[9]  Mohammad Reza Meybodi,et al.  Finding minimum weight connected dominating set in stochastic graph based on learning automata , 2012, Inf. Sci..

[10]  Yuhui Deng,et al.  Ant colony optimization inspired resource discovery in P2P Grid systems , 2009, The Journal of Supercomputing.

[11]  Javad Akbari Torkestani.  A new approach to the job scheduling problem in computational grids , 2011, Cluster Computing.

[12]  Anne-Marie Kermarrec,et al.  From Epidemics to Distributed Computing , 2004 .

[13]  Javad Akbari Torkestani,et al.  Mobility prediction in mobile wireless networks , 2012, J. Netw. Comput. Appl..

[14]  Taskin Koçak,et al.  Design and analysis of a distributed grid resource discovery protocol , 2010, Cluster Computing.

[15]  Javad Akbari Torkestani.  An adaptive focused Web crawling algorithm based on learning automata , 2012, Applied Intelligence.

[16]  Artur Andrzejak,et al.  Scalable, efficient range queries for grid information services , 2002, Proceedings. Second International Conference on Peer-to-Peer Computing,.

[17]  Anne-Marie Kermarrec,et al.  Epidemic information dissemination in distributed systems , 2004, Computer.

[18]  Javad Akbari Torkestani.  DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH , 2012, Cybern. Syst..

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

[20]  Domenico Talia,et al.  A Super-Peer Model for Building Resource Discovery Services in Grids: Design and Simulation Analysis , 2005, EGC.

[21]  Javad Akbari Torkestani.  An adaptive heuristic to the bounded-diameter minimum spanning tree problem , 2012, Soft Comput..

[22]  Javad Akbari Torkestani.  LAAP: A Learning Automata-based Adaptive Polling Scheme for Clustered Wireless Ad-Hoc Networks , 2013, Wirel. Pers. Commun..

[23]  Manish Parashar,et al.  Flexible information discovery in decentralized distributed systems , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[24]  Scott Shenker,et al.  Range Queries over DHTs , 2003 .

[25]  Dan C. Marinescu,et al.  Workflow management and resource discovery for an intelligent grid , 2005, Parallel Comput..

[26]  Javad Akbari Torkestani,et al.  An adaptive backbone formation algorithm for wireless sensor networks , 2012, Comput. Commun..

[27]  Javad Akbari Torkestani,et al.  An adaptive learning to rank algorithm: Learning automata approach , 2012, Decis. Support Syst..

[28]  Mohammad Reza Meybodi,et al.  LLACA: An adaptive localized clustering algorithm for wireless ad hoc networks , 2011, Comput. Electr. Eng..

[29]  Peter Merz,et al.  Fault-tolerant Resource Discovery in Peer-to-peer Grids , 2007, Journal of Grid Computing.

[30]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[31]  Javad Akbari Torkestani.  An adaptive learning automata-based ranking function discovery algorithm , 2012, Journal of Intelligent Information Systems.

[32]  Javad Akbari Torkestani.  A stable virtual backbone for wireless MANETS , 2014, Telecommun. Syst..

[33]  Timothy L. Harris,et al.  XenoSearch: distributed resource discovery in the XenoServer open platform , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[34]  Javad Akbari Torkestani,et al.  Backbone formation in wireless sensor networks , 2012 .

[35]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.