MAAN: A Multi-Attribute Addressable Network for Grid Information Services

  • Authors:
  • Min Cai;Martin Frank;Jinbo Chen;Pedro Szekely

  • Affiliations:
  • -;-;-;-

  • Venue:
  • GRID '03 Proceedings of the 4th International Workshop on Grid Computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recent structured Peer-to-Peer (P2P) systems such asDistributed Hash Tables (DHTs) offer scalable key-basedlookup for distributed resources. However, they cannot besimply applied to grid information services because gridresources need to be registered and searched using multipleattributes. This paper proposes a Multi-Attribute AddressableNetwork (MAAN) which extends Chord to supportmulti-attribute and range queries. MAAN addresses rangequeries by mapping attribute values to the Chord identifierspace via uniform locality preserving hashing. It uses aniterative or single attribute dominated query routing algorithmto resolve multi-attribute based queries. Each nodein MAAN only has O(log N) neighbors for N nodes. Thenumber of routing hops to resolve a multi-attribute rangequery is O(log N + N 脳 smin, where smin is the minimumrange selectivity on all attributes. When smin = \varepsilon, it islogarithmic to the number of nodes, which is scalable to alarge number of nodes and attributes. We also measured theperformance of our MAAN implementation and the experimentalresults are consistent with our theoretical analysis.