Advertisement

A Local Self-stabilizing Enumeration Algorithm

  • Brahim Hamid
  • Mohamed Mosbah
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4025)

Abstract

We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] presented the first self-stabilizing version of this algorithm which tolerates transient failures with an extension of messages complexity. Our version is based on local detection and correction of transient failures. Therefore, it ensures the fault-tolerance property without adding messages or reduces the messages’ number of other version. In addition, we have developed an interface based on the Visidia platform to simulate faults through a graphical user interface. The implementation of the presented algorithm in this platform shows its dynamic execution and validates its correction.

Keywords

IEEE Computer Society Local Computation Label Graph Distribute Computing System Enumeration Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Mazurkiewicz, A.W.: Distributed enumeration. Inf. Processing Letters 61(5), 233–239 (1997)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Godard, E.: A self-stabilizing enumeration algorithm. Inf. Process. Lett. 82(6), 299–305 (2002)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)MATHGoogle Scholar
  4. 4.
    Schneider, M.: Self-stabilization. ACM Computing Surveys 25(1), 45–67 (1993)CrossRefGoogle Scholar
  5. 5.
    Dijkstra, E.W.: Self stabilizing systems in spite of distributed control. Communications of the ACM 17(11), 643–644 (1974)CrossRefMATHGoogle Scholar
  6. 6.
    Hamid, B., Mosbah, M.: An automatic approach to self-stabilization. In: 6th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2005), Baltimore, USA, pp. 129–132 (May 2005)Google Scholar
  7. 7.
    Cournier, A., Datta, A.K., Petit, F., Villain, V.: Self-stabilizing pif algorithms in arbitrary network. In: 21th International Conference on Distributed Computing Systems (ICDCS 2001), pp. 91–98 (April 2001)Google Scholar
  8. 8.
    Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.V.: Fault-containing self-stabilizing algorithms. In: PODC 1996: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, pp. 45–54. ACM Press, New York (1996)CrossRefGoogle Scholar
  9. 9.
    Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction (extended abstract). In: Proceedings of the 32nd annual symposium on Foundations of computer science, pp. 268–277. IEEE Computer Society Press, Los Alamitos (1991)Google Scholar
  10. 10.
    Afek, Y., Dolev, S.: Local stabilizer. In: ISTCS 1997: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS 1997), p. 74. IEEE Computer Society, Los Alamitos (1997)CrossRefGoogle Scholar
  11. 11.
    Afek, Y., Kutten, S., Yung, M.: The local detection paradigm and its applications to self-stabilization. Theor. Comput. Sci. 186(1-2), 199–229 (1997)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Mosbah, M., Sellami, A.: Visidia: A tool for the VIsialization and SImulation of DIstributed Algorithms, http://www.labri.fr/visidia/
  13. 13.
    Litovsky, I., Métivier, Y., Sopena, E.: Graph relabeling systems and distributed algorithms. In: Ehrig, H., Kreowski, H.J., Montanari, U., Rozenberg, G. (eds.) Handbook of graph grammars and computing by graph transformation, vol. III, pp. 1–56. World Scientific Publishing, Singapore (1999)Google Scholar
  14. 14.
    Bauderon, M., Métivier, Y., Mosbah, M., Sellami, A.: Graph Relabeling systems: A tool for encoding, proving, studying and visualizing distributed algorithms. Electronic Notes in Theoretical Computer Science 51 (2001)Google Scholar
  15. 15.
    Métivier, Y., Saheb, N., Zemmari, A.: Randomized rendezvous. In: Birkhauser (ed.) Colloquium on mathematics and computer science: algorithms, trees, combinatorics and probabilities. Trends in mathematics, pp. 183–194 (2000)Google Scholar
  16. 16.
    Hamid, B., Mosbah, M.: Visualization of self-stabilizing distributed algorithms. In: 9th International conference information visualization IV 2005, London, UK. IEEE Computer Society, Los Alamitos (2005) (to appear)Google Scholar
  17. 17.
    Arora, A., Nesterenko, M.: Unifying stabilization and termination in message-passing systems. In: ICDCS 2001: Proceedings of the The 21st International Conference on Distributed Computing Systems, Washington, DC, USA, p. 99. IEEE Computer Society, Los Alamitos (2001)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Brahim Hamid
    • 1
  • Mohamed Mosbah
    • 1
  1. 1.LaBRI- Université Bordeaux-1TalenceFrance

Personalised recommendations