Leveraging a Compound Graph-Based DHT for Multi-Attribute Range Queries with Performance Analysis
Authors:
- 10 February 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 61 (4) , 433-447
Abstract
Resource discovery is critical to the usability and accessibility of grid computing systems. Distributed Hash Table (DHT) has been applied to grid systems as a distributed mechanism for providing scalable range-query and multi-attribute resource discovery. Multi-DHT-based approaches depend on multiple DHT networks with each network responsible for a single attribute. Single-DHT-based approaches keep the resource information of all attributes in a single node. Both classes of approaches lead to high overhead. In this paper, we propose a Low-Overhead Range-query Multi-attribute (LORM) DHT-based resource discovery approach. Unlike other DHT-based approaches, LORM relies on a single compound graph-based DHT network and distributes resource information among nodes in balance by taking advantage of the compound graph structure. Moreover, it has high capability to handle the large-scale and dynamic characteristics of resources in grids. Experimental results demonstrate the efficiency of LORM in comparison with other resource discovery approaches. LORM dramatically reduces maintenance and resource discovery overhead. In addition, it yields significant improvements in resource location efficiency. We also analyze the performance of the LORM approach rigorously by comparing it with other multi-DHT-based and single-DHT-based approaches with respect to their overhead and efficiency. The analytical results are consistent with experimental results, and prove the superiority of the LORM approach in theory.Keywords
This publication has 54 references indexed in Scilit:
- A P2P-based intelligent resource discovery mechanism in Internet-based distributed systemsJournal of Parallel and Distributed Computing, 2009
- Peer-to-peer systems for discovering resources in a dynamic gridParallel Computing, 2007
- Moore: An Extendable Peer-to-Peer Network Based on Incomplete Kautz Digraph with Constant Degree2007
- VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes2006
- Design and implementation tradeoffs for wide-area resource discovery2005
- Systems with multiple servers under heavy-tailed workloadsPerformance Evaluation, 2005
- A scalable content-addressable networkACM SIGCOMM Computer Communication Review, 2001
- Exploiting process lifetime distributions for dynamic load balancingACM Transactions on Computer Systems, 1997
- Consistent hashing and random trees1997
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981