Abstract
In this paper, we introduce a novel Byzantine fault model called time-bounded Byzantine fault that imposes an upper bound on the number of malicious actions of a Byzantine faulty process. We also propose a new method for adaptive fault-containment against time-bounded Byzantine faults that guarantees that the number of perturbed processes depends on the number of malicious actions at Byzantine processes. The proposed information diffusion method imposes k consecutive state changes on a process so that the process diffuses information to processes at distance k. We present an example of a leader election protocol to show the adaptive containment of the proposed method.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Afek, Y., Dolev, S.: Local stabilizer. Journal of Parallel and Distributed Computing 62, 745–765 (2002)
Biely, M., Huttle, M.: Consensus when all processes may be byzantine for some time. In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol. 5873, pp. 120–132. Springer, Heidelberg (2009)
Burman, J., Herman, T., Kutten, S., Patt-Shamir, B.: Asynchronous and fully self-stabilizing time-adaptice majority consensus. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 146–160. Springer, Heidelberg (2006)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of ACM 17(11), 643–644 (1974)
Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.V.: Fault-containing self-stabilizing algorithms. In: Proceedings of the 15th PODC, pp. 45–54 (May 1996)
Kutten, S., Patt-Shamir, B.: Time-adaptive self stabilization. In: Proceedings of the 16th PODC, pp. 149–158 (1997)
Kutten, S., Peleg, D.: Fault-local distributed mending. In: Proceedings of the 14th PODC, pp. 20–27 (August 1995)
Masuzawa, T., Tixeuil, S.: A self-stabilizing link-coloring protocol resilient to unbounded byzantine faults in arbitrary networks. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 118–129. Springer, Heidelberg (2006)
Masuzawa, T., Tixeuil, S.: Bounding the impact of unbounded attacks in stabilization. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol. 4280, pp. 440–453. Springer, Heidelberg (2006)
Nesterenko, M., Arora, A.: Tolerance to unbounded byzantine faults. In: Proceedings of the 21st SRDS, pp. 22–29 (October 2002)
Schneider, M.: Self-stabilization. ACM Computing Survey 25(1), 45–67 (1993)
Widder, J., Gridling, G., Weiss, B., Blanquart, J.: Synchronous consensus with mortal byzantines. In: Proceedings of the 37th DSN, pp. 102–112 (June 2007)
Zhao, Y., Bastani, F.: A self-adjusting algorithm for byzantine agreement. Distributed Computing 5, 219–226 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamauchi, Y., Masuzawa, T., Bein, D. (2010). Adaptive Containment of Time-Bounded Byzantine Faults. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2010. Lecture Notes in Computer Science, vol 6366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16023-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-16023-3_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16022-6
Online ISBN: 978-3-642-16023-3
eBook Packages: Computer ScienceComputer Science (R0)