A Local Enumeration Protocol in Spite of Corrupted Data

We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm. The initial versions 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. The asynchronous message passing version of the presented protocol shows the transformation of distributed algorithms encoded in local computations model, as a high model, to message passing model, as a weaker model. The transformation is given in spite of corrupted information with simple changes

[1]  Wei Chen,et al.  Optimal fault-tolerant routings with small routing tables for k-connected graphs , 2004, J. Discrete Algorithms.

[2]  Piotr Dembinski.  Enumeration Protocol in Estelle: an exercise in stepwise development , 1998, FORTE.

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

[4]  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.

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

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

[7]  Marco Schneider,et al.  Self-stabilization , 1993, CSUR.

[8]  Shlomi Dolev,et al.  Memory requirements for silent stabilization , 1996, PODC '96.

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

[10]  Mohamed G. Gouda,et al.  Stabilizing Communication Protocols , 1991, IEEE Trans. Computers.

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

[12]  Gerard Tel,et al.  Introduction to Distributed Algorithms: Contents , 2000 .

[13]  Hagit Attiya,et al.  Renaming in an asynchronous environment , 1990, JACM.

[14]  Yehuda Afek,et al.  Local stabilizer , 1997, PODC '97.

[15]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

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

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

[18]  Shlomi Dolev,et al.  Memory requirements for silent stabilization , 1999, Acta Informatica.

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

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

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

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

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

[24]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.