By Topic

Enabling Efficient Peer to Peer Resource Discovery in Dynamic Grids Using Variable Size Routing Indexes

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)
Khoobkar, M.H. ; Dept. of Comput. Eng., Islamic Azad Univ. of Lahijan, Lahijan, Iran ; Mahdavi, M.

Existing methods and techniques utilized by peer-to-peer (P2P) systems could address the scalability issue faced by grid systems. Today's Grid systems have to deal with potentially a large number of resources which their status changes over time. Therefore, accurate, fast and scalable discovery of resources are key issues that Grid systems should deal with. Typical P2P systems enable sharing static resources, such as files, among users. However, resources in Grids are dynamic. In this paper, we propose a solution for efficient processing of range queries on available resources. We examine our proposed method using simulation data. The experimental results show that our proposed method improves the performance of existing methods in terms of precision of query processing, average hit rate and network bandwidth consumption.

Published in:

Pervasive Systems, Algorithms, and Networks (ISPAN), 2009 10th International Symposium on

Date of Conference:

14-16 Dec. 2009