Brief announcement: a framework for building self-stabilizing overlay networks

Authors:
Andrew Berns;Sukumar Ghosh;Sriram V. Pemmaraju
Affiliations:
The University of Iowa, Iowa City, IA, USA;The University of Iowa, Iowa City, IA, USA;The University of Iowa, Iowa City, IA, USA
Venue:
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
2010

Citing 3
Cited 5

Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
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
Corona: a stabilizing deterministic message-passing skip list

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing De Bruijn networks

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Discovery through gossip

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Corona: A stabilizing deterministic message-passing skip list

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a simple framework, called the transitive closure framework (TCF), for the self-stabilizing construction of any overlay network. The TCF is easy to reason about and algorithms derived from it stabilize within O(log n) more rounds than the optimal. As evidence of the power of this framework, we derive from the TCF a simple, self-stabilizing protocol for constructing Skip + graphs in O(log n) rounds.