Aurelia: Building Locality-Preserving Overlay Network over Heterogeneous P2P Environments

  • Di Wu
  • Ye Tian
  • Kam-Wing Ng
Conference paper

DOI: 10.1007/11576259_1

Volume 3759 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Wu D., Tian Y., Ng KW. (2005) Aurelia: Building Locality-Preserving Overlay Network over Heterogeneous P2P Environments. In: Chen G., Pan Y., Guo M., Lu J. (eds) Parallel and Distributed Processing and Applications - ISPA 2005 Workshops. ISPA 2005. Lecture Notes in Computer Science, vol 3759. Springer, Berlin, Heidelberg

Abstract

Traditional DHT-based overlays destroy data locality and make it hard to support complex queries (e.g., range query, similarity query, etc) in P2P systems. Additionally, the node heterogeneity is widely ignored in most existing overlay designs. In this paper, we propose a locality-preserving overlay design, called Aurelia, which can adapt to the heterogeneous P2P environment and exploit node heterogeneity to realize efficient routing and robust indexing. Aurelia preserves the data locality by abandoning the use of hashing for data placement and each peer is responsible for a continuous range of value. In Aurelia, the routing table size and index range are proportional to the node capacity, and multicasting is adopted for scalable routing table maintenance.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Di Wu
    • 1
  • Ye Tian
    • 1
  • Kam-Wing Ng
    • 1
  1. 1.Department of Computer Science & EngineeringThe Chinese University of Hong KongShatin, N.T., Hong Kong