The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Grid Resource Discovery Based on a Routing-Transferring Model
GRID '02 Proceedings of the Third International Workshop on Grid Computing
Open Problems in Data-Sharing Peer-to-Peer Systems
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Flexible Information Discovery in Decentralized Distributed Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
XenoSearch: Distributed Resource Discovery in the XenoServer Open Platform
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Grid Information Services for Distributed Resource Sharing
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
A Self-Organizing Flock of Condors
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Collision Detection and Resolution in Hierarchical Peer-to-Peer Systems
LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
Efficient routing for peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Comparing the performance of distributed hash tables under churn
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
When multi-hop peer-to-peer lookup matters
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
The case for a hybrid p2p search infrastructure
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Self-configuring Resource Discovery on a Hypercube Grid Overlay
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
GRID Resource Searching on the GridSim Simulator
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
A Read-Only Distributed Hash Table
Journal of Grid Computing
Gossiping for resource discovering: An analysis based on complex network theory
Future Generation Computer Systems
Decentralized resource discovery mechanisms for distributed computing in peer-to-peer environments
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
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.