|
Published Articles >> Table of Contents >> Abstract
Fourth International Workshop on Grid Computing
p. 184
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
Min Cai, University of Southern California, Marina del Rey
Martin Frank, University of Southern California, Marina del Rey
Jinbo Chen, University of Southern California, Marina del Rey
Pedro Szekely, University of Southern California, Marina del Rey
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/GRID.2003.1261714
Send link to a friend
| Abstract |
|
Recent structured Peer-to-Peer (P2P) systems such as Distributed Hash Tables (DHTs) offer scalable key-based lookup for distributed resources. However, they cannot be simply applied to grid information services because grid resources need to be registered and searched using multiple attributes. This paper proposes a Multi-Attribute Addressable Network (MAAN) which extends Chord to support multi-attribute and range queries. MAAN addresses range queries by mapping attribute values to the Chord identifier space via uniform locality preserving hashing. It uses an iterative or single attribute dominated query routing algorithm to resolve multi-attribute based queries. Each node in MAAN only has O(log N) neighbors for N nodes. The number of routing hops to resolve a multi-attribute range query is O(log N + N × smin, where smin is the minimum range selectivity on all attributes. When smin = \varepsilon, it is logarithmic to the number of nodes, which is scalable to a large number of nodes and attributes. We also measured the performance of our MAAN implementation and the experimental results are consistent with our theoretical analysis.
|
 Additional Information
|
Citation:
Min Cai, Martin Frank, Jinbo Chen, Pedro Szekely,
"MAAN: A Multi-Attribute Addressable Network for Grid Information Services,"
grid,
p. 184,
Fourth International Workshop on Grid Computing,
2003
|
|
