Robust Locality-Aware Lookup Networks

  • Ittai Abraham
  • Dahlia Malkhi
Conference paper

DOI: 10.1007/11428589_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3460)
Cite this paper as:
Abraham I., Malkhi D. (2005) Robust Locality-Aware Lookup Networks. In: Babaoglu O. et al. (eds) Self-star Properties in Complex Information Systems. Lecture Notes in Computer Science, vol 3460. Springer, Berlin, Heidelberg

Abstract

Overlay networks that aim to share information are complex due to numerous factors including scale, decentralization, dynamism, and failures. Deploying, operating and maintaining such overlays can be not only very difficult, but also very costly. In this paper we show how a dynamic overlay can be built and maintained in a cost efficient manner while achieving strong locality properties in a decentralized, dynamic, and faulty environment. In our approach there is no central entity that configures, organizes, and repairs the system. To the contrary, we show that if each peer performs local cost efficient operations then by combining the joint effort of all peers the network manages, configures, and repairs itself.

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

  • Ittai Abraham
    • 1
  • Dahlia Malkhi
    • 1
    • 2
  1. 1.School of Computer Science and EngineeringThe Hebrew University of JerusalemJerusalemIsrael
  2. 2.Microsoft ResearchSilicon Valley

Personalised recommendations