The Community for Technology Leaders
Fourth International Workshop on Assurance in Distributed Systems and Networks (ADSN) (ICDCSW'05) (2005)
Columbus, Ohio, USA
June 6, 2005 to June 10, 2005
ISSN: 1545-0678
ISBN: 0-7695-2328-5
pp: 35-41
Doina Bein , University of Nevada at Las Vegas
Ajoy K. Datta , University of Nevada at Las Vegas
Mehmet H. Karaata , Kuwait University
Safaa Zaman , Kuwait University
ABSTRACT
<p>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.</p> <p>A snap-stabilizing algorithm, starting from an arbitrary system configuration, always behaves according to its specification.</p> <p>In this paper, we propose a snap-stabilizing k-wave algorithm (called, kW) implementing k distinct consecutive waves (k > 2) for trees, with 0(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.</p>
INDEX TERMS
distributing computing, fault tolerance, propagation of information with feedback (PIF), propagation of information with feedback and cleaning (PFC), self-stabilization, snap-stabilization, multi-wave algorithm
CITATION

M. H. Karaata, A. K. Datta, S. Zaman and D. Bein, "An Optimal Snap-Stabilizing Multi-Wave Algorithm," 25th IEEE International Conference on Distributed Computing Systems Workshops(ICDCSW), Columbus, OH USA, 2005, pp. 35-41.
doi:10.1109/ICDCSW.2005.39
96 ms
(Ver 3.3 (11022016))