SKIP+: A self-stabilizing skip graph

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

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

Peer-to-peer systems rely on a scalable overlay network that enables 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 article shows how to maintain such networks in a robust manner. Concretely, we present a distributed and self-stabilizing algorithm that constructs a (slightly extended) skip graph, SKIP+, in polylogarithmic time from any given 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, our algorithm handles individual joins and leaves locally and efficiently.

Original languageEnglish (US)
JournalJournal of the ACM
Volume61
Issue number6
DOIs
StatePublished - Nov 1 2014

Fingerprint

Overlay networks
Peer to peer networks
Telecommunication networks
Topology

Keywords

  • Churn
  • Distributed algorithms
  • Distributed systems
  • Graph theory
  • Overlay networks
  • Peer-topeer systems
  • Performance
  • Robustness
  • Self-stabilization

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software
  • Artificial Intelligence
  • Information Systems
  • Control and Systems Engineering

Cite this

Jacob, R., Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2014). SKIP+: A self-stabilizing skip graph. Journal of the ACM, 61(6). https://doi.org/10.1145/2629695

SKIP+ : A self-stabilizing skip graph. / Jacob, Riko; Richa, Andrea; Scheideler, Christian; Schmid, Stefan; Täubig, Hanjo.

In: Journal of the ACM, Vol. 61, No. 6, 01.11.2014.

Research output: Contribution to journalArticle

Jacob, R, Richa, A, Scheideler, C, Schmid, S & Täubig, H 2014, 'SKIP+: A self-stabilizing skip graph', Journal of the ACM, vol. 61, no. 6. https://doi.org/10.1145/2629695
Jacob R, Richa A, Scheideler C, Schmid S, Täubig H. SKIP+: A self-stabilizing skip graph. Journal of the ACM. 2014 Nov 1;61(6). https://doi.org/10.1145/2629695
Jacob, Riko ; Richa, Andrea ; Scheideler, Christian ; Schmid, Stefan ; Täubig, Hanjo. / SKIP+ : A self-stabilizing skip graph. In: Journal of the ACM. 2014 ; Vol. 61, No. 6.
@article{6984f5d899e04bbca092e53d5ca3bd14,
title = "SKIP+: A self-stabilizing skip graph",
abstract = "Peer-to-peer systems rely on a scalable overlay network that enables 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 article shows how to maintain such networks in a robust manner. Concretely, we present a distributed and self-stabilizing algorithm that constructs a (slightly extended) skip graph, SKIP+, in polylogarithmic time from any given 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, our algorithm handles individual joins and leaves locally and efficiently.",
keywords = "Churn, Distributed algorithms, Distributed systems, Graph theory, Overlay networks, Peer-topeer systems, Performance, Robustness, Self-stabilization",
author = "Riko Jacob and Andrea Richa and Christian Scheideler and Stefan Schmid and Hanjo T{\"a}ubig",
year = "2014",
month = "11",
day = "1",
doi = "10.1145/2629695",
language = "English (US)",
volume = "61",
journal = "Journal of the ACM",
issn = "0004-5411",
publisher = "Association for Computing Machinery (ACM)",
number = "6",

}

TY - JOUR

T1 - SKIP+

T2 - A self-stabilizing skip graph

AU - Jacob, Riko

AU - Richa, Andrea

AU - Scheideler, Christian

AU - Schmid, Stefan

AU - Täubig, Hanjo

PY - 2014/11/1

Y1 - 2014/11/1

N2 - Peer-to-peer systems rely on a scalable overlay network that enables 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 article shows how to maintain such networks in a robust manner. Concretely, we present a distributed and self-stabilizing algorithm that constructs a (slightly extended) skip graph, SKIP+, in polylogarithmic time from any given 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, our algorithm handles individual joins and leaves locally and efficiently.

AB - Peer-to-peer systems rely on a scalable overlay network that enables 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 article shows how to maintain such networks in a robust manner. Concretely, we present a distributed and self-stabilizing algorithm that constructs a (slightly extended) skip graph, SKIP+, in polylogarithmic time from any given 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, our algorithm handles individual joins and leaves locally and efficiently.

KW - Churn

KW - Distributed algorithms

KW - Distributed systems

KW - Graph theory

KW - Overlay networks

KW - Peer-topeer systems

KW - Performance

KW - Robustness

KW - Self-stabilization

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

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

U2 - 10.1145/2629695

DO - 10.1145/2629695

M3 - Article

AN - SCOPUS:84919752723

VL - 61

JO - Journal of the ACM

JF - Journal of the ACM

SN - 0004-5411

IS - 6

ER -