Time-efficient self-stabilizing algorithms through hierarchical structures

Authors:
Felix C. Gärtner;Henning Pagnia
Affiliations:
Swiss Federal Institute of Technology, EPFL, School of Computer and Communication Sciences, Distributed Programming Laboratory, Lausanne, Switzerland;University of Cooperative Education, Mannheim, Germany
Venue:
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Year:
2003

Citing 11
Cited 3

Self-stabilization of dynamic systems assuming only read/write atomicity

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Memory-efficient self stabilizing protocols for general networks

Proceedings of the 4th international workshop on Distributed algorithms
A N algorithm for mutual exclusion in decentralized systems

ACM Transactions on Computer Systems (TOCS)
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Self-stabilization

Self-stabilization
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Engineering Event-Based Systems with Scopes

ECOOP '02 Proceedings of the 16th European Conference on Object-Oriented Programming
Sacrificing True Distribution for Gaining Access Efficiency of Replicated Shared Objects

HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
A Lower Bound on Dynamic k-Stabilization in Asynchronous Systems

SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Self-stabilization of dynamic systems assuming only read/write atomicity

Distributed Computing - Special issue: Self-stabilization
Stabilization and pseudo-stabilization

Distributed Computing - Special issue: Self-stabilization

Empire of colonies: Self-stabilizing and self-organizing distributed algorithm

Theoretical Computer Science
Empire of Colonies: self-stabilizing and self-organizing distributed algorithms

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Time optimal asynchronous self-stabilizing spanning tree

DISC'07 Proceedings of the 21st international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method of combining a self-stabilizing algorithm with a hierarchical structure to construct a self-stabilizing algorithm with improved stabilization time complexity and fault-containment features. As a case study, a self-stabilizing spanning-tree algorithm is presented which in favorable settings has logarithmic stabilization time complexity.