Issue No. 03 - March (2012 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.158
Swan Dubois , UPMC Sorbonne Universite and INRIA, LIP6, Paris
Toshimitsu Masuzawa , Osaka University, Osaka
Sébastien Tixeuil , UPMC Sorbonne Universite and Institut Universitaire de France (IUF), LIP6, Paris
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permit to cope with arbitrary malicious behaviors. Combining these two properties proved difficult: it is impossible to contain the spatial impact of Byzantine nodes in a self-stabilizing context for global tasks such as tree orientation and tree construction. We present and illustrate a new concept of Byzantine containment in stabilization. Our property, called Strong Stabilization enables to contain the impact of Byzantine nodes if they actually perform too many Byzantine actions. We derive impossibility results for strong stabilization and present strongly stabilizing protocols for tree orientation and tree construction that are optimal with respect to the number of Byzantine nodes that can be tolerated in a self-stabilizing context.
Byzantine fault, distributed algorithm, fault tolerance, stabilization, spanning tree construction.
S. Tixeuil, S. Dubois and T. Masuzawa, "Bounding the Impact of Unbounded Attacks in Stabilization," in IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 460-466, 2011.