We consider snap-stabilization in message-passing systems. Snap-stabilization permits to design protocols that withstand transient faults: Any computation that is started after faults cease immediately satisfies the expected specification. Our contribution is twofold, as we demonstrate that in message passing systems (i) snap-stabilization is impossible for nontrivial problems if we consider channels with finite yet unbounded capacity, and (ii) snap-stabilization becomes possible in the same setting with bounded-capacity channels. The latter contribution is constructive, as we propose two snap-stabilizing protocols.

Abstract not found

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. in ria

In this paper, we tackle the problem of snap-stabilization in message-passing sys-tems. Snap-stabilization allows to design protocols that withstand transient faults: indeed, any computation that is started after faults cease immediately satisfies the expected specification. Our contribution is twofold: we demonstrate that in message passing systems (i) snap-stabilization is impossible for nontrivial problems if channels are of finite yet unbounded capacity, and (ii) snap-stabilization becomes possible in the same setting with bounded-capacity channels. The latter contribution is constructive, as we propose two snap-stabilizing protocols for propagation of information with feedback and mutual exclusion. Our work opens exciting new research perspectives, as it enables the snap-stabili-zing paradigm to be implemented in actual networks.