Journal of Grid Computing

, Volume 2, Issue 1, pp 3–14

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

Article

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) that 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 =ɛ, 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.

Keywords

Grid computing information services multi-attribute range queries peer-to-peer 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Andrzejak and Z. Xu, “Scalable, Efficient Range Queries for Grid Information Services,” in Proceedings of the Second IEEE International Conference on Peer-to-Peer Computing, 2002. Google Scholar
  2. 2.
    J. Aspnes and G. Shah, “Skip Graphs,” in Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 384–393. Google Scholar
  3. 3.
    K. Czajkowski, I. Foster, N. Karonis, C. Kesselman, S. Martin, W. Smith and S. Tuecke, “A Resource Management Architecture for Metacomputing Systems,” Lecture Notes in Computer Science, Vol. 1495, 1998. Google Scholar
  4. 4.
    S. Fitzgerald, I. Foster, C. Kesselman, G. Laszewski, W. Smith and S. Tuecke, “A Directory Service for Configuring High-Performance Distributed Computations,” in Proceedings of the 6th IEEE Symposium on High-Performance Distributed Computing, 1997, pp. 365–375. Google Scholar
  5. 5.
    I. Foster and C. Kesselman, “Globus: A Metacomputing Infrastructure Toolkit,” The International Journal of Supercomputer Applications and High Performance Computing, Vol. 11, No. 2, pp. 115–128, 1997. Google Scholar
  6. 6.
  7. 7.
    N.J.A. Harvey, M.B. Jone, S. Saroiu, M. Theimer and A. Wolman, “SkipNet: A Scalable Overlay Network with Practical Locality Properties,” in Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, 2003. Google Scholar
  8. 8.
    A. Iamnitchi, I. Foster and D. Nurmi, “A Peer-to-Peer Approach to Resource Discovery in Grid Environments,” in Proceedings of the 11th Symposium on High Performance Distributed Computing, 2002. Google Scholar
  9. 9.
    F. Kaashoek and D.R. Karger, “Koorde: A Simple Degree-optimal Hash Table,” in The 2nd International Workshop on Peer-to-Peer Systems (IPTPS ‘03), 2003. Google Scholar
  10. 10.
    B. Karp, S. Ratnasamy, S. Rhea and S. Shenker, “Spurring Adoption of DHTs with Open Hash, a Public DHT Servic.,” IRP-TR-03-16, 2003. Google Scholar
  11. 11.
    C.G. Plaxton, R. Rajaraman and A.W. Richa, “Accessing Nearby Copies of Replicated Objects in a Distributed Environment,” in ACM Symposium on Parallel Algorithms and Architectures, 1997, pp. 311–320. Google Scholar
  12. 12.
    S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker, “A Scalable Content Addressable Network,” in Proceedings of ACM SIGCOMM, 2001. Google Scholar
  13. 13.
    S. Ratnasamy, S. Shenker and I. Stoica, “Routing Algorithms for DHTs: Some Open Questions,” in The 2nd International Workshop on Peer-to-Peer Systems (IPTPS ‘03), 2003. Google Scholar
  14. 14.
    P. Reynolds and A. Vahdat, “Efficient Peer-to-Peer Keyword Searching,” in ACM/IFIP/USENIX International Middleware Conference (Middleware 2003), 2003. Google Scholar
  15. 15.
    M. Ripeanu, I. Foster and A. Iamnitchi, “Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design,” IEEE Internet Computing Journal, Vol. 6, No. 1, 2002. Google Scholar
  16. 16.
    A. Rowstron and P. Druschel, “Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems,” Lecture Notes in Computer Science, Vol. 2218, 2001. Google Scholar
  17. 17.
    S. Saroiu, P.K. Gummadi and S.D. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” in Proceedings of Multimedia Computing and Networking 2002, 2002. Google Scholar
  18. 18.
    C. Schmidt and M. Parashar, “Flexible Information Discovery in Decentralized Distributed Systems,” in 12th IEEE International Symposium on High Performance Distributed Computing (HPDC’03), 2003. Google Scholar
  19. 19.
    S. Sen and J. Wong, “Analyzing Peer-to-Peer Traffic Across Large Networks,” in Proceedings of ACM SIGCOMM Workshop on Internet Measurement Workshop, 2002. Google Scholar
  20. 20.
    B. Silaghi, B. Bhattacharjee and P. Keleher, “Query Routing in the TerraDir Distributed Directory,” in SPIE ITCOM’02, 2002. Google Scholar
  21. 21.
    I. Stoica, R. Morris, D. Karger, F. Kaashoek and H. Balakrishnan, “Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications,” in Proceedings of ACM SIGCOMM, 2001. Google Scholar
  22. 22.
    C. Tang, Z. Xu and S. Dwarkadas, “Peer-to-Peer Information Retrieval Using Self-Organizing Semantic Overlay Networks,” in ACM SIGCOMM, 2003. Google Scholar
  23. 23.
    S. Tuecke, K. Czajkowski, I. Foster, J. Frey, S. Graham, C. Kesselman, T. Maguire, T. Sandholm, P. Vanderbilt and D. Snelling, “The Physiology of the Grid: An Open Grid Services Architecture for Distributed Systems Integration,” in Global Grid Forum Draft Recommendation, 2003. Google Scholar
  24. 24.
    H. Zhang, A. Goel and R. Govindan, “Incremental Optimization in Distributed Hash Table Systems,” ACM Sigmetrics, 2003. Google Scholar
  25. 25.
    B. Zhao, J. Kubiatowicz and A. Joseph, “Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing,” Technical Report UCB/CSD-01-1141, 2001. Google Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • Min Cai
    • 1
  • Martin Frank
    • 1
  • Jinbo Chen
    • 1
  • Pedro Szekely
    • 1
  1. 1.Information Sciences InstituteUniversity of Southern CaliforniaMarina Del ReyUSA

Personalised recommendations