An optimal snap-stabilizing multi-wave algorithm

In real-time systems, correct information is needed fast, so developing fast and accurate algorithms is a must. Algorithms must be resilient to transient faults and topology changes. The capability to adapt to heterogeneous and changing requirements is the core of assurance in distributed systems. A...

Full description

Saved in:
Bibliographic Details
Main Authors: Bein, D., Datta, A.K., Karaata, M.H., Zaman, S.
Format: Conference Proceeding
Language:English
Subjects:
Broadcasting
Counting circuits
Distributed computing
distributing computing
fault tolerance
Feedback
Law
multi-wave algorithm
Nominations and elections
Propagation delay
propagation of information with feedback (PIF)
propagation of information with feedback and cleaning (PFC)
self-stabilization
snap-stabilization
State-space methods
Synchronization
Topology
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In real-time systems, correct information is needed fast, so developing fast and accurate algorithms is a must. Algorithms must be resilient to transient faults and topology changes. The capability to adapt to heterogeneous and changing requirements is the core of assurance in distributed systems. A snap-stabilizing algorithm, starting from an arbitrary system configuration, always behaves according to its specification. In this paper, we propose a snap-stabilizing k-wave algorithm (called, kW) implementing k distinct consecutive waves (k > 2) for trees, with O(h) rounds of delay and at most k+4 states per process. The leaf nodes use only four states. The algorithm is optimal with respect to its time and state space complexity, and it can be generalized to arbitrary networks using any of the existing self-stabilizing spanning tree construction algorithms.
ISSN:1545-0678
2332-5666
DOI:10.1109/ICDCSW.2005.39