This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks
Enabling Efficient Peer to Peer Resource Discovery in Dynamic Grids Using Variable Size Routing Indexes
Kaohsiung, Taiwan
December 14-December 16
ISBN: 978-0-7695-3908-9
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.
Index Terms:
Grid Computing, Resource Discovery, Distributed Computing, Peer to Peer Systems, Range query
Citation:
Mohammad Hassan Khoobkar, Mehregan Mahdavi, "Enabling Efficient Peer to Peer Resource Discovery in Dynamic Grids Using Variable Size Routing Indexes," ispan, pp.691-695, 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks, 2009
Usage of this product signifies your acceptance of the Terms of Use.