Self-stabilization with r-operators - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Distributed Computing Année : 2001

Self-stabilization with r-operators

Résumé

This paper describes a parametrized 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.
Fichier principal
Vignette du fichier
ssrop.pdf (278.69 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00632303 , version 1 (14-10-2011)

Identifiants

Citer

Bertrand Ducourthial, Sébastien Tixeuil. Self-stabilization with r-operators. Distributed Computing, 2001, 14 (3), pp.147-162. ⟨10.1007/PL00008934⟩. ⟨hal-00632303⟩
97 Consultations
130 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More