Abstract
This paper proposes and analyses two fully distributed probabilistic splitting and naming procedures which assign a label to each vertex of a given anonymous graph G without any initial knowledge. We prove, in particular, that with probability 1 − o(n − 1) (resp. with probability 1 − o(n − c) for any c ≥ 1) there is a unique vertex with the maximal label in the graph G having n vertices. In the first case, the size of labels is O(logn) with probability 1 − o(n − 1) and the expected value of the size of labels is also O(logn). In the second case, the size of labels is \(O\left((\log n)(\log^* n)^2 \right)\) with probability 1 − o(n − c) for any c ≥ 1; their expected size is \(O\left((\log n)(\log^* n) \right)\).
We analyse a basic simple maximum broadcasting algorithm and prove that if vertices of a graph G use the same probabilistic distribution to choose a label then, for broadcasting the maximal label over the labelled graph, each vertex sends O(logn) messages with probability 1 − o(n − 1).
From these probabilistic procedures we deduce Monte Carlo algorithms for electing or computing a spanning tree in anonymous graphs without any initial knowledge and for counting vertices of an anonymous ring; these algorithms are correct with probability 1 − o(n − 1) or with probability 1 − o(n − c) for any c ≥ 1. The size of messages has the same value as the size of labels. The number of messages is O(mlogn) for electing and computing a spanning tree; it is O(nlogn) for counting the vertices of a ring.
We illustrate the power of the splitting procedure by giving a probabilistic election algorithm for rings having n vertices with identities which is correct and always terminates; its message complexity is equal to O(nlogn) with probability 1 − o(n − 1). (Proofs are omitted for lack of space).
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-319-03578-9_29
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., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distributed Computing 20(4), 279–304 (2007)
Afek, Y., Matias, Y.: Elections in anonymous networks. Inf. Comput. 113(2), 312–330 (1994)
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., Snir, M., Warmuth, M.K.: Computing on an anonymous ring. J. ACM 35(4), 845–875 (1988)
Attiya, H., Welch, J.: Distributed computing: fundamentals, simulations, and advanced topics. John Wiley & Sons (2004)
Fill, J.A., Mahmoud, H.M., Szpankowski, W.: On the distribution for the duration of a randomized leader election algorithm. Ann. Appl. Probab. 6, 1260–1283 (1996)
Guerraoui, R., Ruppert, E.: What can be implemented anonymously? In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 244–259. Springer, Heidelberg (2005)
Itai, A., Rodeh, M.: Symmetry breaking in distributed networks. Inf. Comput. 88(1), 60–87 (1990)
Kalpathy, R., Mahmoud, H.M., Ward, M.D.: Asymptotic properties of a leader election algorithm. Journal of Applied Probability 48(2), 569–575 (2011)
Lavault, C.: Evaluation des algorithmes distribués, Hermès, Paris (1995)
Prodinger, H.: How to select a loser. Discrete Mathematics 120(1-3), 149–159 (1993)
Ramanathan, M.K., Ferreira, R.A., Jagannathan, S., Grama, A., Szpankowski, W.: Randomized leader election. Distributed Computing 19(5-6), 403–418 (2007)
Schieber, B., Snir, M.: Calling names on nameless networks. Inf. Comput. 113(1), 80–101 (1994)
Tel, G.: Introduction to distributed algorithms. Cambridge University Press (2000)
Yamashita, M., Kameda, T.: Computing on an anonymous network. In: PODC, pp. 117–130 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Métivier, Y., Robson, J.M., Zemmari, A. (2013). Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications. In: Moscibroda, T., Rescigno, A.A. (eds) Structural Information and Communication Complexity. SIROCCO 2013. Lecture Notes in Computer Science, vol 8179. Springer, Cham. https://doi.org/10.1007/978-3-319-03578-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-03578-9_13
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03577-2
Online ISBN: 978-3-319-03578-9
eBook Packages: Computer ScienceComputer Science (R0)