A Generic Self-repair Approach for Overlays

  • Barry Porter
  • Geoff Coulson
  • François Taïani
Conference paper

DOI: 10.1007/11915072_54

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4278)
Cite this paper as:
Porter B., Coulson G., Taïani F. (2006) A Generic Self-repair Approach for Overlays. In: Meersman R., Tari Z., Herrero P. (eds) On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops. OTM 2006. Lecture Notes in Computer Science, vol 4278. Springer, Berlin, Heidelberg

Abstract

Self-repair is a key area of functionality in overlay networks, especially as overlays become increasingly widely deployed and relied upon. Today’s common practice is for each overlay to implement its own self-repair mechanism. However, apart from leading to duplication of effort, this practice inhibits choice and flexibility in selecting from among multiple self-repair mechanisms that make different deployment-specific trade-offs between dependability and overhead. In this paper, we present an approach in which overlay networks provide functional behaviour only, and rely for their self-repair on a generic self-repair service. In our previously-published work in this area, we have focused on the distributed algorithms encapsulated within our self-repair service. In this paper we focus instead on API and integration issues. In particular, we show how overlay implementations can interact with our generic self-repair service using a small and simple API. We concretise the discussion by illustrating the use of this API from within an implementation of the popular Chord overlay. This involves minimal changes to the implementation while considerably increasing its available range of self-repair strategies.

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

  • Barry Porter
    • 1
  • Geoff Coulson
    • 1
  • François Taïani
    • 1
  1. 1.Computing DepartmentLancaster UniversityLancasterUK

Personalised recommendations