Snap-Stabilizing Detection of Cutsets

Cournier, Alain; Devismes, Stéphane; Villain, Vincent

doi:10.1007/11602569_50

Cited by 6 publications

(3 citation statements)

References 15 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Various composition techniques have been introduced so far, e.g., collateral composition [15], fair composition [16], and conditional composition [17]; and many self-stabilizing algorithms actually are made as a composition of a silent spanning tree algorithm and another algorithm designed for tree topologies. For example, collateral, fair, and conditional compositions are respectively used the design of the algorithms given in [18], [19], and [20]. Notably, the silence property is not mandatory in such designs, however it allows to write simpler proofs [21].…”

Section: Introductionmentioning

confidence: 99%

Silent Self-stabilizing BFS Tree Algorithms Revised

Devismes¹,

Johnen²

2015

Preprint

Self Cite

View full text Add to dashboard Cite

In this paper, we revisit two fundamental results of the self-stabilizing literature about silent BFS spanning tree constructions: the Dolev et al algorithm and the Huang and Chen's algorithm. More precisely, we propose in the composite atomicity model three straightforward adaptations inspired from those algorithms. We then present a deep study of these three algorithms. Our results are related to both correctness (convergence and closure, assuming a distributed unfair daemon) and complexity (analysis of the stabilization time in terms of rounds and steps).

show abstract

“…Several studies present snap-stabilizing token circulation protocols [30,16,18]. There also exists snap-stabilizing protocols for neighborhood synchronization [28], binary search tree construction [8] and cut-set detection [17]. Cournier et al [15] propose a method to add snap-stabilization to a large class of protocols.…”

Section: Introductionmentioning

confidence: 99%

Snap-Stabilization in Message-Passing Systems

Delaët

Devismes

Nesterenko

et al. 2008

Distributed Computing and Networking

Self Cite

View full text Add to dashboard Cite

In this paper, we tackle the open problem of snap-stabilization in messagepassing systems. Snap-stabilization is a nice approach to design protocols that withstand transient faults. Compared to the well-known self-stabilizing approach, snap-stabilization guarantees that the effect of faults is contained immediately after faults cease to occur. Our contribution is twofold: we show that (1) snap-stabilization is impossible for a wide class of problems if we consider networks with finite yet unbounded channel capacity; (2) snapstabilization becomes possible in the same setting if we assume bounded-capacity channels. We propose three snap-stabilizing protocols working in fully-connected networks. Our work opens exciting new research perspectives, as it enables the snap-stabilizing paradigm to be implemented in actual networks. Stabilisation instantanée dans les systèmesà passage de messagesRésumé : Dans cet article, nous considérons le problème, jusqu'ici ouvert, de la stabilisation instantanée dans les systèmesà passage de messages. La stabilisation instantanée est une approcheélégante permettant de réaliser des protocoles qui supportent les fautes transitoires. Par rapportà l'approche auto-stabilisante, la stabilisation instantanément stabilisante assure que l'effet des fautes est contenu immédiatement après que celles-ci cessent. Notre contribution est double: nous prouvons que (1) la stabilisation instantanée est impossible pour de nombreux problèmes si nous supposons des réseaux où la capacité des canaux de communications est finie mais non bornée; (2) la stabilisation instantanée devient possible avec les mêmes paramètres si on suppose que la capacité des canaux est bornée. A titre d'exemple, Nous proposons trois protocoles instantanément stabilisants fonctionnant dans un réseau complet. Ces travaux ouvrent de nouvelles perspectives de recherche car ils démontrent que la stabilisation instantanée peutêtre implantée dans les réseaux actuels.

show abstract

“…Snap-stabilization has been also addressed to solve other problems in various contexts, e.g., computing binary search trees [16], cutset detection [17], neighborhood synchronization in trees [18], global synchronization in trees [19], committee coordination [20], computing prefix trees in Peer-to-peer systems [21], and linear message forwarding [22,23,24]. Notice that [24] constitutes the first attempt to deal with snap-stabilization in the context of dynamic networks.…”

mentioning

confidence: 99%

The expressive power of snap-stabilization

Cournier

Datta

Devismes

et al. 2016

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

International audienceA snap-stabilizing algorithm, regardless of the initial configuration of the system, guarantees that it always behaves according to its specification. We consider here the locally shared memory model. In this model, we propose the first snap-stabilizing Propagation of Information with Feedback (PIF) algorithm for rooted networks of arbitrary connected topology which is proven assuming the distributed unfair daemon. Then, we use the proposed PIF algorithm as a key module in designing snap-stabilizing solutions for some fundamental problems in distributed systems, such as Leader Election, Reset, Snapshot, and Termination Detection. Finally, we show that in the locally shared memory model, snap-stabilization is as expressive as self-stabilization by designing a universal transformer to provide a snap-stabilizing version of any algorithm that can be self-stabilized with the transformer of Katz and Perry (Distributed Computing, 1993). Since by definition a snap-stabilizing algorithm is also self-stabilizing, self-and snap-stabilization have the same expressiveness in the locally shared memory model

show abstract

Snap-Stabilizing Detection of Cutsets

Cited by 6 publications

References 15 publications

Silent Self-stabilizing BFS Tree Algorithms Revised

Snap-Stabilization in Message-Passing Systems

The expressive power of snap-stabilization

Contact Info

Product

Resources

About