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 language | English (US) |
|---|---|
| Journal | Journal of the ACM |
| Volume | 61 |
| Issue number | 6 |
| DOIs | |
| State | Published - Nov 1 2014 |
Fingerprint
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
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 journal › Article
}
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 -