A distributed polylogarithmic time algorithm for self-stabilizing skip graphs

Riko Jacob, Andrea Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig

Research output: Chapter in Book/Report/Conference proceedingConference contribution

54 Scopus citations

Abstract

Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only needs to connect to a small number of other nodes. In contrast to static communication networks, peer-to-peer networks allow nodes to adapt their neighbor set over time in order to react to join and leave events and failures. This paper shows how to maintain such networks in a robust manner. Concretely, we present a distributed and self-stabilizing algorithm that constructs a (variant of the) skip graph in polylogarithmic time from any initial state in which the overlay network is still weakly connected. This is an exponential improvement compared to previously known self-stabilizing algorithms for overlay networks. In addition, individual joins and leaves are handled locally and require little work.

Original languageEnglish (US)
Title of host publicationPODC'09 - Proceedings of the 2009 ACM Symposium on Principles of Distributed Computing
Pages131-140
Number of pages10
DOIs
StatePublished - Nov 9 2009
Event2009 ACM Symposium on Principles of Distributed Computing, PODC'09 - Calgary, AB, Canada
Duration: Aug 10 2009Aug 12 2009

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference2009 ACM Symposium on Principles of Distributed Computing, PODC'09
CountryCanada
CityCalgary, AB
Period8/10/098/12/09

Keywords

  • Algorithms
  • C.2.4 [computer-communication networks]: distributed systems
  • F.2.2 [analysis of algorithms and problem complexity]: nonnumerical algorithms and problems
  • Theory

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'A distributed polylogarithmic time algorithm for self-stabilizing skip graphs'. Together they form a unique fingerprint.

  • Cite this

    Jacob, R., Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2009). A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In PODC'09 - Proceedings of the 2009 ACM Symposium on Principles of Distributed Computing (pp. 131-140). [1582741] (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). https://doi.org/10.1145/1582716.1582741