Abstract
A tri-redundant version of a system S is a system T that is specified from S as follows. First, system T has the same number of processes and the same topology as system S. Second, each variable x in a process in system S is replaced by three variables x, x ′, and x ″ in the corresponding process in system T. Third, the actions in each process in system S are modified before they are added to the corresponding process in system T and some new actions are added to the corresponding process in system T. In this paper, we show that a tri-redundant version T of a system S has interesting stabilization and fault-masking properties. In particular, we show that if S is stabilizing, then T is also stabilizing. We also show that if T ever reaches stabilization, and then a “visible fault” occurs, then the effect of the fault is masked and the reached stabilization of T remains in effect.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arora, A., Gouda, M.G.: Closure and convergence: A foundation of fault-tolerant computing. IEEE Transactions on Software Engineering 19, 1015–1027 (1993)
Chen, N.-S., Yu, H.-P., Huang, S.-T.: A self-stabilizing algorithm for constructing spanning trees. Inf. Process. Lett. 39(3), 147–151 (1991)
Cournier, A., Datta, A.K., Petit, F., Villain, V.: Enabling Snap Stabilization. In: Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003) (2003)
Dijkstra, E.W.: Self-stabilization in spite of distributed control. ACM Communications 17, 643–644 (1974)
Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
Dolev, S., Herman, T.: Superstabilizing Protocols for Dynamic Distributed Systems. Chicago Journal of Theoretical Computer Science, vol. 1997, Article 4 (1997)
Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.: Fault-containing self-stabilizing algorithms. In: Proceedings of 15th Annual ACM Symposium on Principles of Distributed Computing (PODC 1996), pp. 45–54 (1996)
Ghosh, S., Gupta, A., Pemmaraju, S.: A fault-containing self-stabilizing algorithm for spanning trees. Journal of Computing Information 2, 322–338 (1996)
Herman, T.: A comprehensive bibliography on self-stabilization. Chicago Journal of Theoretical Computer Science (1996)
Herman, T., Pemmaraju, S.: Error-detecting codes and fault-containing self-stabilization. Information Processing Letters 73, 41–46 (2000)
Huang, C.T., Gouda, M.G.: State Checksum and Its Role in System Stabilization. In: Proceedings of the 4th International Workshop on Assurance in Distributed Systems and Networks (ADSN 2005) (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gouda, M.G., Cobb, J.A., Huang, CT. (2006). Fault Masking in Tri-redundant Systems. In: Datta, A.K., Gradinariu, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2006. Lecture Notes in Computer Science, vol 4280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49823-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-49823-0_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49018-0
Online ISBN: 978-3-540-49823-0
eBook Packages: Computer ScienceComputer Science (R0)