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
T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
SP - 131
EP - 140
BT - PODC'09 - Proceedings of the 2009 ACM Symposium on Principles of Distributed Computing
T2 - 2009 ACM Symposium on Principles of Distributed Computing, PODC'09
Y2 - 10 August 2009 through 12 August 2009
ER -