On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract)

Most known snapshot algorithms assume that the vertices of the network have unique identifiers and/or that there is exactly one initiator. This paper concerns snapshot computation in an anonymous network and more generally what stable properties of a distributed system can be computed anonymously with local snapshots with multiple initiators when knowing an upper bound on the diameter of the network.

[1]  Michel Raynal.  Networks and Distributed Computation , 1988 .

[2]  Sebastiano Vigna,et al.  Fibrations of graphs , 2002, Discret. Math..

[3]  Masafumi Yamashita,et al.  Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct , 1999, IEEE Trans. Parallel Distributed Syst..

[4]  Ajay D. Kshemkalyani,et al.  Distributed Computing: Index , 2008 .

[5]  Rachid Guerraoui,et al.  What Can Be Implemented Anonymously? , 2005, DISC.

[6]  Ajay D. Kshemkalyani,et al.  An introduction to snapshot algorithms in distributed computing , 1995, Distributed Syst. Eng..

[7]  Jérémie Chalopin.  Algorithmique distribuée, calculs locaux et homomorphismes de graphes , 2006 .

[8]  Nicola Santoro,et al.  Design and analysis of distributed algorithms , 2006, Wiley series on parallel and distributed computing.

[9]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[10]  Yves Métivier,et al.  An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm , 2007, Fundam. Informaticae.

[11]  Tracy Camp,et al.  A taxonomy of distributed termination detection algorithms , 1998, J. Syst. Softw..

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

[13]  Masafumi Yamashita,et al.  Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases , 1996, IEEE Trans. Parallel Distributed Syst..

[14]  Boleslaw K. Szymanski,et al.  Synchronized Distributed Termination , 1985, IEEE Transactions on Software Engineering.

[15]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

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

[17]  André Schiper,et al.  Strong stable properties in distributed systems , 1994, Distributed Computing.

[18]  T. Kameda,et al.  Computing functions on asynchronous anonymous networks , 1998, Theory of Computing Systems.

[19]  Sebastiano Vigna,et al.  Symmetry Breaking in Anonymous Networks: Characterizations , 1996, ISTCS.

[20]  Sebastiano Vigna,et al.  Computing anonymously with arbitrary knowledge , 1999, PODC '99.

[21]  Dana Angluin,et al.  Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[22]  Ralph E. Johnson,et al.  Symmetry and similarity in distributed systems , 1985, PODC '85.

[23]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[24]  Michel Raynal,et al.  Networks and distributed computation: concepts, tools, and algorithms , 1988 .