2008/02/08 by Sylvie Delaët, Delaët, Sylvie, Stéphane Devismes +5
Computer Science · #Distributed #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Parallel #Performance (cs.PF) #and Cluster Computing (cs.DC) #cs.DC #cs.NI #cs.PF
paper · pdf · doi:10.48550/arxiv.0802.1123
arxiv created 2008/02/11 · arxiv updated 2009/12/01
In this paper, we tackle the open problem of snap-stabilization in message-passing 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) snap-stabilization 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.