Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
O(log n)-time overlay network construction from graphs with out-degree 1
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Re-Chord: a self-stabilizing chord overlay network
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 5.23 |
Overlay networks are expected to operate in hostile environments where node and link failures are commonplace. One way to make overlay networks robust is to design self-stabilizing overlay networks, i.e., overlay networks that can handle node and link failures without any external supervision. In this paper, we first describe a simple framework, which we call the Transitive Closure Framework (TCF), for the self-stabilizing construction of an extensive class of overlay networks. Like previous self-stabilizing algorithms for overlay networks, TCF permits intermediate node degrees to grow to @W(n), independent of the maximum degree of the target overlay network. However, TCF has several advantages over previous work in this area: (i) it is a ''framework'' and can be used for the construction of a variety of overlay networks (e.g. Linear, Skip+), not just a particular network, (ii) it runs in an optimal number of rounds for a variety of overlay networks, and (iii) it can easily be composed with other non-self-stabilizing protocols that can recover from specific bad initial states in a memory-efficient fashion. We demonstrate the power of our framework by deriving from TCF a simple self-stabilizing protocol for constructing Skip+ graphs [R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Taubig, A distributed polylogarithmic time algorithm for self-stabilizing skip graphs, in: PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing, ACM, New York, NY, USA, 2009, pp. 131-140] that guarantees optimal convergence time from any configuration.