Tolerating Transient and Intermittent Failures

doi:10.1006/jpdc.2001.1827

Journal of Parallel and Distributed Computing

Volume 62, Issue 5, May 2002, Pages 961-981

https://doi.org/10.1006/jpdc.2001.1827 Get rights and content

Abstract

Fault tolerance is a crucial property for recent distributed systems. We propose an algorithm that solves the census problem (list all processor identifiers and their relative distance) on an arbitrary strongly connected network.

This algorithm tolerates transient faults that corrupt the processors and communication links memory (it is self-stabilizing) as well as intermittent faults (fair loss, reorder, finite duplication of messages) on communication media. A formal proof establishes its correctness for the considered problem. Our algorithm leads to the construction of algorithms for any silent problems that are self-stabilizing while supporting the same communication hazards.

References (29)

S. Dolev
Self-stabilizing routing and related protocols
J. Parallel Distrib. Comput.
(1997)
N.V. Stenning
A data transfer protocol
Computer Networks
(1976)
Y. Afek et al.
Self-stabilizing unidirectional network algorithms by power supply
Chicago J. Theoret. Comput. Sci.
(1998)
Y. Afek et al.
Self-stabilization over unreliable communication media
Distrib. Comput.
(1993)
Y. Afek et al.
Memory-efficient self-stabilization on general networks
(1990)
E. Anagnostou et al.
Tolerating transient and permanent failures
(1993)
B. Awerbuch et al.
Self-stabilization by local checking and correction
K.A. Bartlett et al.
A note on reliable full-duplex transmission over half-duplex links
Comm. Assoc. Comput. Mach.
(1969)
A. Basu et al.
Simulating reliable links in the presence of process crashes
(1996)
J. Beauquier et al.
Self-stabilizing census with cut-through constraint
(1999)

J. Beauquier et al.

Fault tolerance and self-stabilization: Impossibility results and solutions using self-stabilizing failure detectors

Int. J. Systems Sci.

(1997)

A. Bui et al.

State-optimal snap-stabilizing pif in tree networks

Proceedings of the 4th Workshop on Self-stabilizing Systems

(1999)

S.K. Das et al.

Self-stabilizing algorithms in dag structured networks

Parallel Process. Lett.

(1999)

S. Delaët et al.

Un algorithme auto-stabilisant en dépit de communications non fiables

Tech. Sci. Inform.

(1988)

Cited by (20)

Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures
2011, Theoretical Computer Science
A wireless sensor network is a set of nodes, each is equipped with a sensing device and a wireless communication device. Because centralized control is hard to achieve in a large scale sensor network, self- $*$ is a key concept in the design of a wireless sensor network. Self-stabilization is one of the self- $*$ properties, and it is one of the most promising theoretical backgrounds for self-organizing wireless sensor network protocols. Herman [T. Herman, Models of self-stabilization and sensor networks, in: Proceedings of the 5th International Workshop of Distributed Computing, IWDC, 2003, pp. 205–214] proposed Cached Sensornet Transform (CST for short) for design and implementation of self-stabilizing algorithms for sensor networks. It transforms a self-stabilizing algorithm in a high-level computational model to a program for sensor networks. Our contribution in this paper is threefold. We show that there exists a non-silent algorithm that behaves correctly in a high-level computational model but its transformed version by CST does not behave correctly if packets are lost. We show a sufficient condition for original algorithms and networks such that the algorithm transformed by CST behaves correctly. As a case study, we present a token circulation algorithm that behaves correctly by CST and derive the upper bound of its expected convergence time.
Possibility and Impossibility of Propagation Safety and Reliability: A 1-Safe and Reliable Snap-Stabilizing Broadcast Algorithm
2023, IEEE Transactions on Dependable and Secure Computing
Self-stabilizing c-wave algorithms for arbitrary networks
2023, Computing
A reliable concurrent multicast algorithm for content distribution
2022, Journal of Supercomputing
Resource efficient stabilization for local tasks despite unknown capacity links
2020, arXiv
Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge
2017, Parallel Processing Letters

View all citing articles on Scopus

^☆: An extended abstract of a preliminary version of this paper appeared in [3]. This work was supported in part by the French STAR project.

^f1: [email protected]

^f2: [email protected]

²: To whom correspondence should be addressed.

View full text

Regular ArticleTolerating Transient and Intermittent Failures☆

Abstract

J. Parallel Distrib. Comput.

Computer Networks

Self-stabilizing unidirectional network algorithms by power supply

Chicago J. Theoret. Comput. Sci.

Self-stabilization over unreliable communication media

Distrib. Comput.

Memory-efficient self-stabilization on general networks

Tolerating transient and permanent failures

Self-stabilization by local checking and correction

A note on reliable full-duplex transmission over half-duplex links

Comm. Assoc. Comput. Mach.

Simulating reliable links in the presence of process crashes

Self-stabilizing census with cut-through constraint