Active Stabilization

We propose the notion of active stabilization for computing systems. Unlike typical stabilizing programs (called passive stabilizing in this paper) that require that the faults are absent for a long enough time for the system to recover to legitimate states, active stabilizing programs ensure recovery in spite of constant perturbation during the recovery process by an adversary. We identify the relation between active and passive stabilization in terms of their behavior and by comparing their cost of verification. We propose a method for designing active stabilizing programs by a collection of passive stabilizing programs. Finally, we compare active stabilization with fault-contained stabilization and stabilization in the presence of Byzantine faults.

[1]  Mahyar R. Malekpour,et al.  A Byzantine-Fault Tolerant Self-stabilizing Protocol for Distributed Clock Synchronization Systems , 2006, SSS.

[2]  Christian Scheideler,et al.  Stabilization, Safety, and Security of Distributed Systems , 2012, Lecture Notes in Computer Science.

[3]  Synnöve Kekkonen-Moneta,et al.  On FTSS-solvable distributed problems , 1997, PODC '97.

[4]  Anish Arora,et al.  Multitolerance in Distributed Reset , 1998, Chic. J. Theor. Comput. Sci..

[5]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[6]  Mohamed G. Gouda,et al.  Stabilizing Communication Protocols , 1991, IEEE Trans. Computers.

[7]  Murat Demirbas,et al.  A Pursuer-Evader Game for Sensor Networks , 2003, Self-Stabilizing Systems.

[8]  Mohamed G. Gouda.  The Theory of Weak Stabilization , 2001, WSS.

[9]  Anish Arora,et al.  Tolerance to unbounded Byzantine faults , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..

[10]  Sébastien Tixeuil,et al.  Weak vs. Self vs. Probabilistic Stabilization , 2007, 2008 The 28th International Conference on Distributed Computing Systems.

[11]  Hongwei Zhang,et al.  Guaranteed fault containment and local stabilization in routing , 2006, Comput. Networks.

[12]  Anish Arora.  Efficient Reconfiguration of Trees: A Case Study in Methodical Design of Nonmasking Fault-Tolerant Programs , 1994, FTRTFT.

[13]  George Varghese,et al.  Constraint satisfaction as a basis for designing nonmasking fault-tolerance , 1996, J. High Speed Networks.

[14]  Amos Israeli,et al.  Uniform Dynamic Self-Stabilizing Leader Election , 1997, IEEE Trans. Parallel Distributed Syst..

[15]  Arobinda Gupta,et al.  Fault-containing self-stabilizing algorithms , 1996, PODC '96.

[16]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[17]  Anish Arora,et al.  Local Tolerance to Unbounded Byzantine Faults , 2002 .

[18]  Sébastien Tixeuil,et al.  Self-Stabilizing Systems , 2003, Lecture Notes in Computer Science.

[19]  Arobinda Gupta,et al.  An Exercise in Fault-Containment: Self-Stabilizing Leader Election , 1996, Inf. Process. Lett..