Self-stabilization with r-operators |
| |
Authors: | Bertrand Ducourthial Sébastien Tixeuil |
| |
Affiliation: | (1) Laboratoire Heudiasyc, UMR CNRS 6599, Université de Technologie de Compiègne, BP 20529, 60205 Compiègne Cedex, France (e-mail: Bertrand.Ducourthial@utc.fr) , FR;(2) Laboratoire de Recherche en Informatique, UMR CNRS 8623, Batiment 490, Université de Paris Sud, 91405 Orsay Cedex, France (e-mail: tixeuil@lri.fr) , FR |
| |
Abstract: | This paper describes a parameterized distributed algorithm applicable to any directed graph topology. The function parameter
of our algorithm is instantiated to produce distributed algorithms for both fundamental and high level applications, such
as shortest path calculus and depth-first-search tree construction. Due to fault resilience properties of our algorithm, the
resulting protocols are self-stabilizing at no additional cost. Self-stabilizing protocols can resist transient failures and
guarantee system recovery in a finite time. Since the condition on the function parameter (being a strictly idempotent r-operator) permits a broad range of applications to be implemented, the solution presented in our paper can be useful for
a large class of distributed systems.
Received: August 1999 / Accepted: January 2001 |
| |
Keywords: | :Self-stabilization – r-operators – Distributed systems – Read-write atomicity – Unfair scheduling |
本文献已被 SpringerLink 等数据库收录! |
|