Caching Indices for Efficient Lookup in Structured Overlay Networks

  • Vasilios Darlagiannis
  • Nicolas Liebau
  • Oliver Heckmann
  • Andreas Mauthe
  • Ralf Steinmetz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4118)

Abstract

Structured overlay networks for Peer-to-Peer systems (e.g. based on Distributed Hash Tables) use proactive mechanisms to provide efficient indexing functionality for advertised resources. The majority of their occurrences in proposed systems (e.g. Chord, Pastry) provide upper bounds (logarithmic complexity with respect to the size of the graph representing the network) on the communication cost in worst case scenarios and their performance is superior compared to unstructured alternatives. However, in particular (empirically observed) scenarios where the popularity of the advertised resources follows a distribution considerably different from the uniform distribution, structured P2P networks may perform inferiorly compared to well designed unstructured P2P networks that exploit effectively the resource popularity distribution. In order to address this issue, a very simple caching mechanism is suggested in this paper that preserves the theoretical superiority of structured overlay networks regardless of the popularity of the advertised resources. Moreover, the churn effect observed in Peer-to-Peer systems is considered. The proposed mechanism is evaluated using simulation experimesnts.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Vasilios Darlagiannis
    • 1
  • Nicolas Liebau
    • 1
  • Oliver Heckmann
    • 1
  • Andreas Mauthe
    • 2
  • Ralf Steinmetz
    • 1
  1. 1.Multimedia Communications Lab (KOM), Technische Universität DarmstadtDarmstadtGermany
  2. 2.Computing DepartmentLancaster UniversityLancasterUK

Personalised recommendations