Please use this identifier to cite or link to this item:
|Title:||DGRID: A DHT-based resource indexing and discovery scheme for computational grids||Authors:||March, V.
Distributed hash table
Resource indexing and discovery
|Issue Date:||2007||Citation:||March, V.,Teo, Y.M.,Wang, X. (2007). DGRID: A DHT-based resource indexing and discovery scheme for computational grids. Conferences in Research and Practice in Information Technology Series 68 : 41-48. ScholarBank@NUS Repository.||Abstract:||Traditional DHT (Distributed Hash Tables) abstraction distributes data items among peer nodes ona 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. © 2007, Australian Computer Society, Inc.||Source Title:||Conferences in Research and Practice in Information Technology Series||URI:||http://scholarbank.nus.edu.sg/handle/10635/39658||ISBN:||192068249X||ISSN:||14451336|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 22, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.