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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Chalopin, J., Métivier, Y., & Morsellino, T. (2012). On snapshots and stable properties detection in anonymous fully distributed systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7355 LNCS, pp. 207–218). https://doi.org/10.1007/978-3-642-31104-8_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
