Abstract
We consider the message complexity of achieving consensus in synchronous anonymous message passing systems. Unlabeled processors (nodes) communicate through links of a network. In each round every processor can exchange messages with all neighbors and the duration of each transmission is one round. An adversary wakes up some subset of processors at possibly different times and assigns them arbitrary numerical input values. All other processors are dormant and do not have input values. Any message wakes up a dormant processor. The goal of consensus is to wake up all processors and have them agree on one of the input values. We seek deterministic consensus algorithms using as few messages as possible. As opposed to most of the literature on consensus, the difficulty of our scenario are not faults (we assume that the network is fault-free) but the arbitrary network topology combined with the anonymity of nodes.
For unknown n-node networks we show a consensus algorithm using O(n 2) messages; this complexity is optimal for this class. We show that if the network is known, then the complexity of consensus decreases significantly. Our main contribution is an algorithm that uses O(n 3/2log2 n) messages on any n-node network and we show that some networks require Ω(nlogn) messages to achieve consensus. We also observe that availability of distinct labels of nodes helps to improve complexity of consensus for known networks but has no effect for the class of unknown networks. Indeed, even with labeled nodes, Ω(n 2) messages are sometimes necessary if the network is unknown but for known labeled networks consensus can be always achieved with O(n) messages.
This work was done during the visit of Emanuele G. Fusco at the Research Chair in Distributed Computing of the Université du Québec en Outaouais.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Angluin, D.: Local and global properties in networks of processors. In: Proc. 12th Annual ACM Symposium on Theory of Computing (STOC), pp. 82–93 (1980)
Attiya, H., Snir, M., Warmuth, M.: Computing on an Anonymous Ring. Journal of the ACM 35, 845–875 (1988)
Attiya, H., Snir, M.: Better Computing on the Anonymous Ring. Journal of Algorithms 12, 204–238 (1991)
Attiya, H., Welch, J.: Distributed Computing. John Wiley and Sons, Inc. (2004)
Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proc. 18th ACM Symp. on Principles of Distributed Computing (PODC), pp. 181–188 (1999)
Burns, J.E.: A formal model for message passing systems, Tech. Report TR-91, Computer Science Department. Indiana University, Bloomington (September 1980)
Chlebus, B.S., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in ad hoc radio networks. Distributed Computing 15, 27–38 (2002)
Chlebus, B.S., Gąsieniec, L., Kowalski, D.R., Radzik, T.: On the Wake-Up Problem in Radio Networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 347–359. Springer, Heidelberg (2005)
Chlebus, B.S., Kowalski, D.R.: A better wake-up in radio networks. In: Proc. 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 266–274 (2004)
Chlebus, B.S., Kowalski, D.R., Strojnowski, M.: Scalable Quantum Consensus for Crash Failures. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 236–250. Springer, Heidelberg (2010)
Chockler, G., Demirbas, M., Gilbert, S., Lynch, N.A., Newport, C.C., Nolte, T.: Consensus and collision detectors in radio networks. Distributed Computing 21, 55–84 (2008)
Chrobak, M., Gasieniec, L., Kowalski, D.R.: The wake-up problem in multi-hop radio networks. In: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 985–993 (2004)
Codenotti, B., Gemmell, P., Simon, J.: Symmetry breaking in anonymous networks: characterizations. In: Proc. 4th Israel Symposium on Theory of Computing and Systems (ISTCS 1996), pp. 16–26 (1996)
Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with un- known topology. In: Proc. 44th IEEE Symposium on Foundations of Computer Science (FOCS 2003), pp. 492–501 (2003)
Czyzowicz, J., Gąsieniec, L., Kowalski, D.R., Pelc, A.: Consensus and Mutual Exclusion in a Multiple Access Channel. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 512–526. Springer, Heidelberg (2009)
Diks, K., Kranakis, E., Malinowski, A., Pelc, A.: Anonymous wireless rings. Theoretical Computer Science 145, 95–109 (1995)
Gasieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM Journal on Discrete Mathematics 14, 207–222 (2001)
Gilbert, S., Kowalski, D.R.: Distributed agreement with optimal communication complexity. In: Proc. 21st ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 965–977 (2010)
Kranakis, E.: Symmetry and Computability in Anonymous Networks: A Brief Survey. In: Proc. 3rd Int. Conf. on Structural Information and Communication Complexity, pp. 1–16 (1997)
Kranakis, E., Krizanc, D., van der Berg, J.: Computing Boolean Functions on Anonymous Networks. Information and Computation 114, 214–236 (1994)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publ., Inc. (1996)
Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27, 228–234 (1980)
Raynal, M.: Fault-Tolerant Agreement in Synchronous Distributed Systems. Morgan & Claypool Publishers (2010)
Sakamoto, N.: Comparison of Initial Conditions for Distributed Algorithms on Anonymous Networks. In: Proc. 18th ACM Symp. on Principles of Distributed Computing (PODC 1999), pp. 173–179 (1999)
Yamashita, M., Kameda, T.: Computing on anonymous networks. In: Proc. 7th ACM Symp. on Principles of Distributed Computing (PODC 1988), pp. 117–130 (1988)
Yamashita, M., Kameda, T.: Computing on anonymous networks: Part I - characterizing the solvable cases. IEEE Trans. Parallel and Distributed Systems 7, 69–89 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fusco, E.G., Pelc, A. (2011). Communication Complexity of Consensus in Anonymous Message Passing Systems. In: Fernàndez Anta, A., Lipari, G., Roy, M. (eds) Principles of Distributed Systems. OPODIS 2011. Lecture Notes in Computer Science, vol 7109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25873-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-25873-2_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25872-5
Online ISBN: 978-3-642-25873-2
eBook Packages: Computer ScienceComputer Science (R0)