A Grid Information Services Architecture Based on Structured P2P Systems

Structured P2P systems prove efficient in query operation and adaptive dynamic updates. This paper presents a Grid information services architecture based on structured P2P topology, namely distributed hash table (DHT). It resolves problems which centralized topology owns, such as single points of failure and low query efficiency. In the proposed architecture, each resource node and Index server is given an m-bit identifier by hashing resource attribute values. Every node makes connection with successor Index server according to their identifiers. To avoid structured P2P breaking formal relationship of a virtual organization (VO), all resource information will be managed by a local Information server instead of the Index server. The Index server just keeps index to provide resource query service. Range query is a vital part in Grid resource query but structured P2P systems cannot resolve it well. To support range query service, we propose a tree data structure and Path Caching Schemes to improve the proposed architecture. Theoretical analysis and simulation results show that the proposed Grid information services architecture is efficient, robust, load balanced, and scalable.

[1]  Ian T. Foster,et al.  The Anatomy of the Grid: Enabling Scalable Virtual Organizations , 2001, Int. J. High Perform. Comput. Appl..

[2]  Ben Y. Zhao,et al.  Tapestry: a fault-tolerant wide-area application infrastructure , 2002, CCRV.

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

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

[5]  Ang P.S.,et al.  Master\'s Dissertation , 2009 .

[6]  Ian T. Foster,et al.  Grid information services for distributed resource sharing , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.

[7]  Jun'ichi Tatemura,et al.  On overlay schemes to support point-in-range queries for scalable grid resource discovery , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[8]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.

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

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

[11]  Divyakant Agrawal,et al.  Approximate Range Selection Queries in Peer-to-Peer Systems , 2003, CIDR.

[12]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[13]  Ian Foster,et al.  On Fully Decentralized Resource Discovery in Grid Environments , 2001, GRID.

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