Cart (Loading....) | Create Account
Close category search window
 

Adaptive Peer to Peer Resource Discovery in Grid Computing Based on Reinforcement Learning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jamali, M.A.J. ; Dept. of Comput. Sci., Islamic Azad Univ., Shabestar, Iran ; Sani, Y.

Grid computing provides a distributed computing environment which supports high performance and data intensive applications by enabling the sharing and selecting various resources. In grid environment resources are heterogeneous and geographically distributed. By receiving a resource request the resource discovery mechanism should return an appropriate resource if there exist one. Resource discovery is a challenging problem because of the heterogeneity and distribution of resources. The centralized and hierarchical resource discovery mechanisms are not suitable for large scale and dynamic resources. On the other hand peer to peer systems are successful in distributed computing because of their scalability and robustness. In this paper, we propose an adaptive peer to peer resource discovery algorithm using reinforcement learning for grid computing that can be used for multi resource requests. The algorithm achieves the most suitable node that can satisfy the requested resource by using the past experience of agents. We compare our model with random walk resource discovery through simulation and the results show that the proposed algorithm provides higher success rate, less message passing and shorter response time. Also the algorithm leads to load balancing in whole grid. According to results our algorithm has a higher performance in large scale grids.

Published in:

Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD), 2011 12th ACIS International Conference on

Date of Conference:

6-8 July 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.