On snapshots and stable properties detection in anonymous fully distributed systems (Extended abstract)

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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00695582
Contributor : Yves Métivier <>
Submitted on : Wednesday, May 9, 2012 - 11:37:16 AM
Last modification on : Friday, March 9, 2018 - 11:26:03 AM

Identifiers

  • HAL Id : hal-00695582, version 1

Collections

Citation

Jérémie Chalopin, Yves Métivier, Thomas Morsellino. On snapshots and stable properties detection in anonymous fully distributed systems (Extended abstract). 19th International Colloquium on Structural Information and Communication Complexity, Jun 2012, Iceland. pp.207-218. ⟨hal-00695582⟩

Share

Metrics

Record views

234