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

  • Di Wu
  • Ye Tian
  • Kam-Wing Ng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3759)

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.

References

  1. 1.
    Saroiu, S.: Measurement and analysis of internet content delivery systems. Doctoral Dissertation, University of Washington (2004)Google Scholar
  2. 2.
    Stoica, I., et al.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. ACM (SIGCOMM 2001), San Diego, CA, pp. 149–160 (2001)Google Scholar
  3. 3.
    Rowstron, A., Druschel., P.: Pastry: Scalable, distributed object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Gupta, A., Agrawal, D., Abbadi, A.E.: Approximate range selection queries in peer-to-peer systems. In: Proc. the First Biennial Conference on Innovative Data System Research (CIDR 2003), Asilomar, CA, USA (2003)Google Scholar
  5. 5.
    Cai, M., Frank, M., Chen, J., Szekely, P.: Maan: A multi-attribute addressable network for grid information services. In: Proc. 4th International Workshop on Grid Computing (Grid 2003), Phoenix, Arizona (2003)Google Scholar
  6. 6.
    Schmidt, C., Parashar, M.: Enabling flexible queries with guarantees in p2p systems. Internet Computing Journal 8(3) (2004)Google Scholar
  7. 7.
    Ramabhadran, S., Ratnasamy, S., Hellerstein, J.M., Shenker, S.: Brief announcement: Prefix hash tree. In: Proc. ACM (PODC 2004), St. Johns, Canada (2004)Google Scholar
  8. 8.
    Harvey, N.J.A., et al.: Skipnet: A scalable overlay network with practical locality properties. In: Proc. Fourth USENIX Symposium on Internet Technologies and Systems (USITS 2003), Seattle, WA (2003)Google Scholar
  9. 9.
    Hu, J., Li, M., Zheng, W.-M., Wang, D., Ning, N., Dong, H.: SmartBoa: Constructing p2p overlay network in the heterogeneous internet using irregular routing tables. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 278–287. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.

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

Personalised recommendations