Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction

Authors:
Toshimitsu Masuzawa;Taisuke Izumi;Yoshiaki Katayama;Koichi Wada
Affiliations:
Osaka University, Suita, Japan 565-0871;Nagoya Institute of Technology, Nagoya, Japan 466-8555;Nagoya Institute of Technology, Nagoya, Japan 466-8555;Nagoya Institute of Technology, Nagoya, Japan 466-8555
Venue:
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Year:
2009

Citing 7
Cited 3

Stable Leader Election

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Optimal Implementation of the Weakest Failure Detector for Solving Consensus

SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
On implementing omega with weak reliability and synchrony assumptions

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Communication-efficient leader election and consensus with limited link synchrony

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Optimal message-driven implementations of omega with mute processes

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Communication Efficiency in Self-Stabilizing Silent Protocols

ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Robust stabilizing leader election

SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems

Low communication self-stabilization through randomization

DISC'10 Proceedings of the 24th international conference on Distributed computing
Silence is golden: self-stabilizing protocols communication-efficient after convergence

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Communication-Efficient self-stabilization in wireless networks

SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most of self-stabilizing protocols require every pair of neighboring processes to communicate with each other repeatedly and forever even after converging to legitimate configurations. Such permanent communication impairs efficiency, but is necessary in nature of self-stabilization. So it is challenging to minimize the number of process pairs communicating after convergence. In this paper, we investigate possibility of communication-efficient self-stabilization for spanning-tree construction, which allows only O (n ) pairs of neighboring processes to communicate repeatedly after convergence.