论文信息 - An improved DHT-based Grid Information services architecture

An improved DHT-based Grid Information services architecture

Fundamental problems that confront traditional centralized Grid information services are low query efficiency and single points of failure. This paper presents an improved DHT-based Grid information services architecture, that resolves these problems well. The architecture assigns each resource node and information server an m-bit identifier by hashing attribute values. Every node makes connection with successor information server according to their identifiers to organize Virtual Organization(VO). Resource query is highly efficient with locating identifier. Information servers are fully decentralized, solving single points of failure. Range query is a difficult problem in DHT but an indispensable part in Grid information services. We improve our architecture with tree data structure and Path Caching Schemes to support range query. Results from theory analysis and simulations show that DHT-based architecture is highly efficient, robust, load balanced and scalable.

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

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

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

[4] Robert Morris,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

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

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

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

[8] Steven Tuecke,et al. The Physiology of the Grid An Open Grid Services Architecture for Distributed Systems Integration , 2002 .

[9] 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).

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

[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 .