Abstract
This paper presents a new transformation which adds fault-containment properties to silent self-stabilizing algorithms. The transformation features a constant slow-down factor and the fault-gap—that is the minimal time between two containable faults—is also constant. The transformation scales well to arbitrarily large systems and avoids global synchronization. The presented transformation is the first with a constant fault-gap and requires no knowledge of the system size.
Similar content being viewed by others
References
Angluin, D.: Local and global properties in networks of processors (extended abstract). In: Proceedings of the 12th Annual ACM Symposium on Theory of Computing, pp. 82–93. ACM (1980). doi:10.1145/800141.804655
Beauquier, J., Delaët, S., Haddad, S.: A 1-strong self-stabilizing transformer. In: Proceedings of the 8th International Symposium on Stabilization, Safety, and Security of Distributed Systems, pp. 95–109. Springer (2006). doi:10.1007/978-3-540-49823-0_7
Burman, J., Herman, T., Kutten, S., Patt-Shamir, B.: Asynchronous and fully self-stabilizing time-adaptive majority consensus. In: 9th International Conference on Principles of Distributed Systems, pp. 146–160. Springer (2006). doi:10.1007/11795490_13
Dasgupta, A., Ghosh, S., Xiao, X.: Probabilistic fault-containment. In: Proceedings of the 9th International Symposium on Stabilization, Safety, and Security of Distributed Systems, pp. 189–203. Springer (2007). doi:10.1007/978-3-540-76627-8_16
Dasgupta, A., Ghosh, S., Xiao, X.: Fault-containment in weakly- stabilizing systems. In: Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, pp. 209–223. Springer (2009). doi:10.1007/978-3-642-05118-0_15
Dijkstra E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1976). doi:10.1145/361179.361202
Ghosh S., Gupta A.: An exercise in fault-containment: self-stabilizing leader election. Inf. Process. Lett. 59(5), 281–288 (1996). doi:10.1016/0020-0190(96)00121-4
Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.V.: Fault-containing self-stabilizing algorithms. In: Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pp. 45–54. ACM (1996). doi:10.1145/248052.248057
Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.V.: Fault-containing self-stabilizing distributed protocols. Tech. Rep. 00-01, Department of Computer Science, The University of Iowa (2000)
Ghosh S., Gupta A., Herman T., Pemmaraju S.V.: Fault-containing self-stabilizing distributed protocols. Distrib. Comput. 20(1), 53–73 (2007). doi:10.1007/s00446-007-0032-2
Ghosh S., Gupta A., Pemmaraju S.V.: A fault-containing self-stabilizing spanning tree algorithm. J. Comput. Inf. 2(1), 322–338 (1196)
Ghosh, S., Gupta, A., Pemmaraju, S.V.: Fault-containing network protocols. In: Proceedings of the 1997 ACM Symposium on Applied Computing, pp. 431–437. ACM (1997). doi:10.1145/331697.332329
Ghosh S., He X.: Fault-containing self-stabilization using priority scheduling. Inf. Process. Lett. 73(3-4), 145–151 (2000). doi:10.1016/S0020-0190(00)00006-5
Herman T., Pemmaraju S.: Error-detecting codes and fault-containing self-stabilization. Inf. Process. Lett. 73(1-2), 41–46 (2000). doi:10.1016/S0020-0190(99)00164-7
Huang T.C.: An efficient fault-containing self-stabilizing algorithm for the shortest path problem. Distrib. Comput. 19(2), 149–161 (2006). doi:10.1007/s00446-006-0001-1
Köhler, S., Turau, V.: Fault-containing self-stabilization in asynchronous systems with constant fault-gap. In: Proceedings of the 30th IEEE International Conference on Distributed Computing Systems, pp. 418–427. IEEE Computer Society, Los Alamitos, CA, USA (2010). doi:10.1109/ICDCS.2010.10
Köhler, S., Turau, V.: A new technique for proving self-stabilization under the distributed scheduler. In: Proceedings of the 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS’10). Lecture Notes in Computer Science, vol. 6366, pp. 65–79. Springer (2010). doi:10.1007/978-3-642-16023-3_8
Kutten S., Peleg D.: Fault-local distributed mending. J. Algorithms 30(1), 144–165 (1999). doi:10.1006/jagm.1998.0972
Lamport, L.: Solved problems, unsolved problems and non-problems in concurrency. In: Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing, pp. 1–11. ACM (1984). doi:10.1145/800222.806731
Lin J.C., Huang T.C.: An efficient fault-containing self-stabilizing algorithm for finding a maximal independent set. IEEE Trans. Parallel Distrib. Syst. 14(8), 742–754 (2003). doi:10.1109/TPDS.2003.1225054
Yamauchi, Y., Kamei, S., Ooshita, F., Katayama, Y., Kakugawa, H., Masuzawa, T.: Composition of fault-containing protocols based on recovery waiting fault-containing composition framework. In: Proceedings of the 8th International Symposium on Stabilization, Safety, and Security of Distributed Systems, pp. 516–532. Springer (2006). doi:10.1007/978-3-540-49823-0_36
Yamauchi, Y., Kamei, S., Ooshita, F., Katayama, Y., Kakugawa, H., Masuzawa, T.: Timer-based composition of fault-containing self-stabilizing protocols. In: Proceedings of the 2nd International Symposium on Intelligent Distributed Computing, pp. 217–226. Springer (2008). doi:10.1007/978-3-540-85257-5_22
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was funded by the German Research Foundation (DFG), contract number TU 221/3-1.
A preliminary version [16] of this paper appeared in Proc. 30th IEEE International Conference on Distributed Computing Systems (ICDCS 2010).
Rights and permissions
About this article
Cite this article
Köhler, S., Turau, V. Fault-containing self-stabilization in asynchronous systems with constant fault-gap. Distrib. Comput. 25, 207–224 (2012). https://doi.org/10.1007/s00446-011-0155-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00446-011-0155-3