Sukumar Ghosh
- 1.R. J. Abbott, "Resourceful Systems for Fault Tolerance, Reliability, and Safety," A CM Computing Surveys, Vol. 22, 1990, pp. 35-68. Google Scholar
Digital Library
- 2.E. Anagnostou, R. EI-Yaniv, and V. Hadzilacos, "Memory Adaptive Self-stabilizing Protocols", Sixth International Workshop on Distributed Algorithms, Springer LNCS 647, 1992, pp. 203-220. Google ScholarDigital Library
- 3.A. Arora and M. G. Gouda, "Closure and Convergence: A Foundation for Fault-Tolerant Computing," iEEE Transactions on Software Engineering, Vol. 19, 1993, pp. 1015-1027. Google ScholarDigital Library
- 4.B. Awerbuch, "Complexity of Network Synchronization,'' Journal of the A CM, Vol. 32, 1985, pp. 804-823. Google ScholarDigital Library
- 5.B. Awerbuch and G. Varghese, "Self-Stabilization by Local Checking and Correction," IEEE Symposium on Foundations of Computer Science, 1991, pp. 268-277. Google ScholarDigital Library
- 6.N. S. Chen, H. P. Yu, and S. T. Huang, "A Self- Stabilizing Algorithm for Constructing a Spanning Tree," Information Processing Letters, Vol. 39, 1991, pp. 147-151. Google ScholarDigital Library
- 7.S. Dolev and T. Herman, "Superstabilizing Protocols for Dynamic Distributed Systems," Second Workshop on Self-Stabilizing Systems, 1995, pp. 3.1-3.15.Google Scholar
- 8.S. Ghosh, A. Gupta, and S. V. Pemmaraju, "A Faultcontaining Self-stabilizing Spanning Tree Algorithm," Technical Report TR-95-08, Department of Computer Science, The University of Iowa, Iowa City, 1995.Google Scholar
- 9.S. Ghosh and A. Gupta, "An Exercise in Faultcontainment: Leader Election on a Ring," submitted for publication.Google Scholar
- 10.M. G. Gouda, "The Triumph and Tribulation of System Stabilization," Ninth International Workshop on Distributed Algorithms, Springer LNCS 972, 1995, pp. 1-18. Google ScholarDigital Library
- 11.M. G. Gouda and M. Schneider, "Maximum Flow Routing," Second Workshop on Self-Stabilizing Systems, 1995, pp. 2.1-2.13.Google Scholar
- 12.T. Herman, "Superstabilizing Mutual Exclusion," International Conference on Parallel and Distributed Systems, Athens, GA., 1995.Google Scholar
- 13.S. Kutten and D. Peleg, "Fault-Local Distributed Mending," Fourteenth Annual A CM Symposium on Principles of Distributed Computing, 1995, pp. 20-27. Google ScholarDigital Library
- 14.Z. Manna and A. Pnueli, The Temporal Aspects of Reactive and Concurrent Systems, Springer Verlag, New York, 1992. Google ScholarDigital Library
- 15.V. C. Nelson, "Fault-tolerant Computing: Fundamen~ tal Concepts", IEEE Computer, Vol. 23, No. 7, July 1990, pp. 19-25. Google ScholarDigital Library
- 16.G. Parlati and M. Yung, "Non-Exploratory Self- Stabilization for Constant-Space Symmetry Breaking'', Algorithms ESA 94, Springer LNCS 855, 1994, pp. 183-201. Google ScholarDigital Library
Index Terms
- Fault-containing self-stabilizing algorithms
Recommendations
Fault-containing self-stabilizing distributed protocols
Self-stabilization is an elegant approach for designing a class of fault-tolerant distributed protocols. A self-stabilizing protocol is guaranteed to eventually converge to a legitimate state after a transient fault. However, even a minor transient ...
Timer-based composition of fault-containing self-stabilizing protocols
One of the desired properties of distributed systems is self-adaptability against faults. Self-stabilizing protocols provide autonomous recovery from any finite number of transient faults. However, in practice, catastrophic faults rarely occur, while ...
Comments