By Topic

An optimal snap-stabilizing multi-wave algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
D. Bein ; Sch. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA ; A. K. Datta ; M. H. Karaata ; S. Zaman

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.

Published in:

25th IEEE International Conference on Distributed Computing Systems Workshops

Date of Conference:

6-10 June 2005