An advanced performance analysis of self-stabilizing protocols: stabilization time with transient faults during convergence

Authors:
Yoshihiro Nakaminami;Hirotsugu Kakugawa;Toshimitsu Masuzawa
Affiliations:
Osaka University, Dept. of Information Science and Technology, Toyonaka, Osaka,Japan;Osaka University, Dept. of Information Science and Technology, Toyonaka, Osaka,Japan;Osaka University, Dept. of Information Science and Technology, Toyonaka, Osaka,Japan
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 10
Cited 4

A self-stabilizing algorithm for maximal matching

Information Processing Letters
Maximal matching stabilizes in quadratic time

Information Processing Letters
Fault-containing self-stabilizing algorithms

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Time-adaptive self stabilization

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Self-stabilization

Self-stabilization
Fault-containing self-stabilization using priority scheduling

Information Processing Letters
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Maximal matching stabilizes in time O(m)

Information Processing Letters
Linear time self-stabilizing colorings

Information Processing Letters
Self-stabilization in spite of frequent changes of networks: case study of mutual exclusion on dynamic rings

SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems

On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion

SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Fast Distributed Approximations in Planar Graphs

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion

SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Self-stabilising protocols on oriented chains with joins and leaves

International Journal of Autonomous and Adaptive Communications Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A self-stabilizing protocol is a brilliant framework for fault tolerance. It can recover from any number and any type of transient faults and eventually converge to its intended behavior. Performance of a self-stabilizing protocol is usually measured by stabilization time: the time required to complete the convergence to its intended behavior under the assumption that no new fault occurs during the convergence. But a self-stabilizing protocol has no guarantee to complete the convergence if faults are frequently occurred. This paper brings new light to efficiency analysis of stabilization. The efficiency is evaluated with consideration for faults occurring during the convergence. To show the feasibility and effectiveness of the approach, this paper applies the approach to the maximal matching protocol.