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

53 Citations (Scopus)

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 publicationProceedings of the Annual ACM Symposium on Principles of Distributed Computing
Pages131-140
Number of pages10
DOIs
StatePublished - 2009
Event2009 ACM Symposium on Principles of Distributed Computing, PODC'09 - Calgary, AB, Canada
Duration: Aug 10 2009Aug 12 2009

Other

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

Fingerprint

Overlay networks
Peer to peer networks
Telecommunication networks
Topology

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

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 Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 131-140). [1582741] https://doi.org/10.1145/1582716.1582741

A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. / Jacob, Riko; Richa, Andrea; Scheideler, Christian; Schmid, Stefan; Täubig, Hanjo.

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. 2009. p. 131-140 1582741.

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

Jacob, R, Richa, A, Scheideler, C, Schmid, S & Täubig, H 2009, A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. in Proceedings of the Annual ACM Symposium on Principles of Distributed Computing., 1582741, pp. 131-140, 2009 ACM Symposium on Principles of Distributed Computing, PODC'09, Calgary, AB, Canada, 8/10/09. https://doi.org/10.1145/1582716.1582741
Jacob R, Richa A, Scheideler C, Schmid S, Täubig H. A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. 2009. p. 131-140. 1582741 https://doi.org/10.1145/1582716.1582741
Jacob, Riko ; Richa, Andrea ; Scheideler, Christian ; Schmid, Stefan ; Täubig, Hanjo. / A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. 2009. pp. 131-140
@inproceedings{b99c9cf540f042c5bf845074dad6bb84,
title = "A distributed polylogarithmic time algorithm for self-stabilizing skip graphs",
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.",
keywords = "Algorithms, C.2.4 [computer-communication networks]: distributed systems, F.2.2 [analysis of algorithms and problem complexity]: nonnumerical algorithms and problems, Theory",
author = "Riko Jacob and Andrea Richa and Christian Scheideler and Stefan Schmid and Hanjo T{\"a}ubig",
year = "2009",
doi = "10.1145/1582716.1582741",
language = "English (US)",
isbn = "9781605583969",
pages = "131--140",
booktitle = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

}

TY - GEN

T1 - A distributed polylogarithmic time algorithm for self-stabilizing skip graphs

AU - Jacob, Riko

AU - Richa, Andrea

AU - Scheideler, Christian

AU - Schmid, Stefan

AU - Täubig, Hanjo

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - Algorithms

KW - C.2.4 [computer-communication networks]: distributed systems

KW - F.2.2 [analysis of algorithms and problem complexity]: nonnumerical algorithms and problems

KW - Theory

UR - http://www.scopus.com/inward/record.url?scp=70350627243&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350627243&partnerID=8YFLogxK

U2 - 10.1145/1582716.1582741

DO - 10.1145/1582716.1582741

M3 - Conference contribution

AN - SCOPUS:70350627243

SN - 9781605583969

SP - 131

EP - 140

BT - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

ER -