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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Symposium on Theory of Computing, pp. 82–93 (1980)
Attiya, H., Welch, J.: Distributed computing: fundamentals, simulations, and advanced topics. John Wiley & Sons (2004)
Boldi, P., Codenotti, B., Gemmell, P., Shammah, S., Simon, J., Vigna, S.: Symmetry breaking in anonymous networks: Characterizations. In: Proc. 4th Israeli Symposium on Theory of Computing and Systems, pp. 16–26. IEEE Press (1996)
Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, pp. 181–188. ACM Press (1999)
Boldi, P., Vigna, S.: Fibrations of graphs. Discrete Math. 243, 21–66 (2002)
Chalopin, J.: Algorithmique distribuée, calculs locaux et homorphismes de graphes. PhD thesis, université Bordeaux 1 (2006)
Chandy, K.M., Lamport, L.: Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comput. Syst. 3(1), 63–75 (1985)
Chalopin, J., Métivier, Y.: An efficient message passing election algorithm based on mazurkiewicz’s algorithm. Fundam. Inform. 80(1-3), 221–246 (2007)
Guerraoui, R., Ruppert, E.: What Can Be Implemented Anonymously? In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 244–259. Springer, Heidelberg (2005)
Gross, J.L., Tucker, T.W.: Topological graph theory. Wiley Interscience (1987)
Johnson, R.E., Schneider, F.B.: Symmetry and similarities in distributed systems. In: Proc. 4th Conf. on Principles of Distributed Computing, pp. 13–22 (1985)
Kshemkalyani, A.D., Raynal, M., Singhal, M.: An introduction to snapshot algorithms in distributed computing. Distributed Systems Engineering 2(4), 224–233 (1995)
Kshemkalyani, A.D., Singhal, M.: Distributed computing, Cambridge (2008)
Mazurkiewicz, A.: Distributed enumeration. Inf. Processing Letters 61, 233–239 (1997)
Matocha, J., Camp, T.: A taxonomy of distributed termination detection algorithms. Journal of Systems and Software 43(3), 207–221 (1998)
Raynal, M.: Networks and distributed computation. MIT Press (1988)
Santoro, N.: Design and analysis of distributed algorithm. Wiley (2007)
Schiper, A., Sandoz, A.: Strong stable properties in distributed systems. Distributed Computing 8(2), 93–103 (1994)
Szymanski, B., Shy, Y., Prywes, N.: Synchronized distributed termination. IEEE Transactions on Software Engineering SE-11(10), 1136–1140 (1985)
Tel, G.: Introduction to distributed algorithms. Cambridge University Press (2000)
Yamashita, M., Kameda, T.: Computing functions on asynchronous anonymous networks. Math. Systems Theory 29, 331–356 (1996)
Yamashita, M., Kameda, T.: Computing on anonymous networks: Part i - characterizing the solvable cases. IEEE Transactions on Parallel and Distributed Systems 7(1), 69–89 (1996)
Yamashita, M., Kameda, T.: Leader election problem on networks in which processor identity numbers are not distinct. IEEE Transactions on Parallel and Distributed Systems 10(9), 878–887 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chalopin, J., Métivier, Y., Morsellino, T. (2012). On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract). In: Even, G., Halldórsson, M.M. (eds) Structural Information and Communication Complexity. SIROCCO 2012. Lecture Notes in Computer Science, vol 7355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31104-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-31104-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31103-1
Online ISBN: 978-3-642-31104-8
eBook Packages: Computer ScienceComputer Science (R0)