The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2012 vol.23)
pp: 460-466
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
ABSTRACT
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.
INDEX TERMS
Byzantine fault, distributed algorithm, fault tolerance, stabilization, spanning tree construction.
CITATION
Swan Dubois, Toshimitsu Masuzawa, Sébastien Tixeuil, "Bounding the Impact of Unbounded Attacks in Stabilization", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 3, pp. 460-466, March 2012, doi:10.1109/TPDS.2011.158
REFERENCES
[1] M. Ben-Or, D. Dolev, and E.N. Hoch, "Fast Self-Stabilizing Byzantine Tolerant Digital Clock Synchronization," Proc. ACM Symp. Principles of Distributed Computing (PODC '08), pp. 385-394, 2008.
[2] A. Daliot and D. Dolev, "Self-Stabilization of Byzantine Protocols," Proc. Seventh Symp. Self-Stabilizing Systems (SSS '05), pp. 48-67, 2005.
[3] E.W. Dijkstra, "Self-Stabilizing Systems in Spite of Distributed Control," Comm. ACM, vol. 17, no. 11, pp. 643-644, 1974.
[4] D. Dolev and E.N. Hoch, "On Self-Stabilizing Synchronous Actions despite Byzantine Attacks," Proc. Int'l Symp. Distributed Computing (DISC '07), pp. 193-207, 2007.
[5] S. Dolev, Self-Stabilization. MIT Press, 2000.
[6] S. Dolev and J.L. Welch, "Self-Stabilizing Clock Synchronization in the Presence of Byzantine Faults," J. ACM, vol. 51, no. 5, pp. 780-799, 2004.
[7] F.C. Gärtner, "A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms," Technical Report ic/2003/38, EPFL, 2003.
[8] E.N. Hoch, D. Dolev, and A. Daliot, "Self-Stabilizing Byzantine Digital Clock Synchronization," Proc. Int'l Conf. Stabilization, Safety, and Security of Distributed Systems (SSS '06), pp. 350-362, 2006.
[9] L. Lamport, R.E. Shostak, and M.C. Pease, "The Byzantine Generals Problem," ACM Trans. Programming Languages and Systems, vol. 4, no. 3, pp. 382-401, 1982.
[10] T. Masuzawa and S. Tixeuil, "Bounding the Impact of Unbounded Attacks in Stabilization," Proc. Int'l Conf. Stabilization, Safety, and Security of Distributed Systems (SSS '06), pp. 440-453, 2006.
[11] T. Masuzawa and S. Tixeuil, "Stabilizing Link-Coloration of Arbitrary Networks with Unbounded Byzantine Faults," Int'l J. Principles and Applications of Information Science and Technology, vol. 1, no. 1, pp. 1-13, 2007.
[12] M. Nesterenko and A. Arora, "Tolerance to Unbounded Byzantine Faults," Proc. IEEE Symp. Reliable Distributed Systems (SRDS '02), pp. 22-29, 2002.
[13] Y. Sakurai, F. Ooshita, and T. Masuzawa, "A Self-Stabilizing Link-Coloring Protocol Resilient to Byzantine Faults in Tree Networks," Proc. Int'l Conf. Principles of Distributed Systems (OPODIS '04), pp. 283-298, 2005.
[14] S. Tixeuil, "Self-Stabilizing Algorithms," Algorithms and Theory of Computation Handbook, second ed., pp. 26.1-26.45, Chapman & Hall/CRC Applied Algorithms and Data Structures, 2009.
[15] Y. Yamauchi, T. Masuzawa, and D. Bein, "Adaptive Containment of Time-Bounded Byzantine Faults," Proc. Int'l Conf. Stabilization, Safety, and Security of Distributed Systems (SSS '10), pp. 126-140, 2010.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool