DGRID: A DHT-Based Resource Indexing and Discovery Scheme for Computational Grids

Traditional DHT (Distributed Hash Tables) abstraction distributes data items among peer nodes on a structured overlay network. This introduces a number of issues when nodes are under different administrative authorities. In this paper, we propose DGRID, a new DHT abstraction for grid resource indexing and discovery where an administrative domain stores only its own data items. This is achieved by having each unique resource type belonging to an administrative domain to join a DHT as a node with a unique identifier. Using Chord as the underlying overlay graph, we show that DGRID lookup path length is at worst comparable with traditional DHT. However, DGRID is by design resilient to node failures without the need to replicate data items.

[1]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[2]  Yong Meng Teo,et al.  Multi-Attribute Range Queries on Read-Only DHT , 2006, Proceedings of 15th International Conference on Computer Communications and Networks.

[3]  Yong Meng Teo,et al.  Collision Detection and Resolution in Hierarchical Peer-to-Peer Systems , 2005, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l.

[4]  Ion Stoica,et al.  The Case for a Hybrid P2P Search Infrastructure , 2004, IPTPS.

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

[6]  Anjali Gupta,et al.  Efficient Routing for Peer-to-Peer Overlays , 2004, NSDI.

[7]  Miguel Castro,et al.  Secure routing for structured peer-to-peer overlay networks , 2002, OSDI '02.

[8]  Yong Meng Teo,et al.  An adaptive stabilization framework for distributed hash tables , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[9]  Weidong Xiao,et al.  Decentralized Grid Resource Discovery Based on Resource Information Community , 2004, Journal of Grid Computing.

[10]  Krishna P. Gummadi,et al.  The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.

[11]  Jun Zhang,et al.  Grid Resource Discovery Based on a Routing-Transferring Model , 2002, GRID.

[12]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[13]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[14]  Ian T. Foster,et al.  Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations , 2002, IPTPS.

[15]  Y. Charlie Hu,et al.  A Self-Organizing Flock of Condors , 2003, ACM/IEEE SC 2003 Conference (SC'03).

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

[17]  Timothy L. Harris,et al.  XenoSearch: distributed resource discovery in the XenoServer open platform , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[18]  Rodrigo Rodrigues,et al.  When Multi-hop Peer-to-Peer Lookup Matters , 2004, IPTPS.

[19]  Robert Tappan Morris,et al.  Comparing the Performance of Distributed Hash Tables Under Churn , 2004, IPTPS.

[20]  Min Cai,et al.  MAAN: A Multi-Attribute Addressable Network for Grid Information Services , 2003, Journal of Grid Computing.

[21]  Manish Parashar,et al.  Flexible information discovery in decentralized distributed systems , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[22]  Zsolt Németh,et al.  Characterizing Grids: Attributes, Definitions, and Formalisms , 2003, Journal of Grid Computing.

[23]  Hector Garcia-Molina,et al.  Open Problems in Data-Sharing Peer-to-Peer Systems , 2003, ICDT.

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