A Local Self-stabilizing Enumeration Algorithm

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.

[1]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[2]  Yehuda Afek,et al.  Local Stabilizer , 2002, J. Parallel Distributed Comput..

[3]  Christos H. Papadimitriou,et al.  Proceedings of the 32nd annual symposium on Foundations of computer science , 1991 .

[4]  Anish Arora,et al.  Unifying stabilization and termination in message-passing systems , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[5]  Emmanuel Godard.  A self-stabilizing enumeration algorithm , 2002, Inf. Process. Lett..

[6]  Brahim Hamid,et al.  Visualization of self-stabilizing distributed algorithms , 2005, Ninth International Conference on Information Visualisation (IV'05).

[7]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[8]  Antoni W. Mazurkiewicz.  Distributed Enumeration , 1997, Inf. Process. Lett..

[9]  Arobinda Gupta,et al.  Fault-containing self-stabilizing algorithms , 1996, PODC '96.

[10]  Boaz Patt-Shamir,et al.  Self-stabilization by local checking and correction , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[11]  N. Saheb,et al.  Randomized Rendezvous , 2000 .

[12]  Anish Arora,et al.  Unifying stabilization and termination in message-passing systems , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[13]  Yves Métivier,et al.  Graph relabelling systems and distributed algorithms , 1999 .

[14]  Moti Yung,et al.  The Local Detection Paradigm and Its Application to Self-Stabilization , 1997, Theor. Comput. Sci..

[15]  Ajoy Kumar Datta,et al.  Self-stabilizing PIF algorithm in arbitrary rooted networks , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[16]  Brahim Hamid,et al.  An automatic approach to self-stabilization , 2005, Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Network.

[17]  Yves Métivier,et al.  Graph Relabelling Systems: a Tool for Encoding, Proving, Studying and Visualizing - Distributed Algorithms , 2001, Electron. Notes Theor. Comput. Sci..

[18]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[19]  Yves Métivier,et al.  Graph Relabelling Systems: a Tool for Encoding, Proving, Studying and Visualizing - Distributed Algorithms , 2002, GETGRATS Closing Workshop.