SKIP+: A Self-Stabilizing Skip Graph

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

Grafik Top
Authors
  • Jacob, Riko
  • Richa, Andrea
  • Scheideler, Christian
  • Schmid, Stefan
  • Täubig, Hanjo
Grafik Top
Supplemental Material
Shortfacts
Category
Journal Paper
Divisions
Communication Technologies
Subjects
Informatik Allgemeines
Journal or Publication Title
Journal of the ACM
ISSN
0004-5411
Date
November 2014
Export
Grafik Top