SKIP: A Self-Stabilizing Skip Graph

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

Full description

Saved in:
Bibliographic Details
Published in:Journal of the ACM 2014-11, Vol.61 (6), p.1-26
Main Authors: Jacob, Riko, Richa, Andrea, Scheideler, Christian, Schmid, Stefan, Täubig, Hanjo
Format: Article
Language:English
Subjects:
Algorithms
Communication networks
Graphs
Handles
Networks
Routing (telecommunications)
Skips
Social networks
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0004-5411
1557-735X
DOI:10.1145/2629695