Self-stabilization with r-operators revisited - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Aerospace Computing, Information, and Communication Année : 2006

Self-stabilization with r-operators revisited

Résumé

We present a generic distributed algorithm for solving silents tasks such as shortest path calculus, depth-first-search tree construction, best reliable transmitters, in directed networks where communication may be only unidirectional. Our solution is written for the asynchronous message passing communication model, and tolerates multiple kinds of failures (transient and intermittent). First, our algorithm is self-stabilizing, so that it recovers correct behavior after finite time starting from an arbitrary global state caused by a transient fault. Second, it tolerates fair message loss, finite message duplication, and arbitrary message reordering, during both the stabilizing phase and the stabilized phase. This second property is most interesting since, in the context of unidirectional networks, there exist no self-stabilizing reliable data-link protocol. The correctness proof subsumes previous proofs for solutions in the simpler reliable shared memory communication model.
Fichier principal
Vignette du fichier
ssroprev.pdf (349.17 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

Sylvie Delaët, Bertrand Ducourthial, Sébastien Tixeuil. Self-stabilization with r-operators revisited. Journal of Aerospace Computing, Information, and Communication, 2006, 3 (10), pp.498-514. ⟨10.2514/1.19848⟩. ⟨hal-00632413⟩
495 Consultations
478 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More