Abstract
This paper presents a distributed algorithm, called \(\mathcal{STT}\), for electing deterministically a leader in an arbitrary network, assuming processors have unique identifiers of size \(O(\log n)\), where n is the number of processors. It elects a leader in \(O(D +\log n)\) rounds, where D is the diameter of the network, with messages of size O(1). Thus it has a bit round complexity of \(O(D +\log n)\). This substantially improves upon the best known algorithm whose bit round complexity is \(O(D\log n)\). In fact, using the lower bound by Kutten et al. [13] and a result of Dinitz and Solomon [8], we show that the bit round complexity of \(\mathcal{STT}\) is optimal (up to a constant factor), which is a step forward in understanding the interplay between time and message optimality for the election problem. Our algorithm requires no knowledge on the graph such as n or D.
A full version of this paper can be found on arXiv (http://arxiv.org/abs/1605.01903).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
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. Wiley, Hoboken (2004)
Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems (detailed summary). In: Proceedings of 19th Symposium on Theory of Computing, New York, USA, pp. 230–240 (1987)
Bar-Noy, A., Naor, J., Naor, M.: One-bit algorithms. Distrib. Comput. 4, 3–8 (1990)
Bodlaender, H.L., Moran, S., Warmuth, M.K.: The distributed bit complexity of the ring: from the anonymous case to the non-anonymous case. Inf. Comput. 114(2), 34–50 (1994)
Bodlaender, H.L., Tel, G.: Bit-optimal election in synchronous rings. Inf. Process. Lett. 36(1), 53–56 (1990)
Dinitz, Y., Moran, S., Rajsbaum, S.: Bit complexity of breaking and achieving symmetry in chains and rings. J. ACM 55(1), 167–183 (2008)
Dinitz, Y., Solomon, N.: Two absolute bounds for distributed bit complexity. Theor. Comput. Sci. 384(2–3), 168–183 (2007)
Fusco, E.G., Pelc, A.: Knowledge, level of symmetry, and time of leader election. Distrib. Comput. 28(4), 221–232 (2015)
Gallager, R.G.: Finding a leader in a network with \(o(e\, {+}\, n\log n)\) messages. Technical Report Internal Memo., M.I.T., Cambridge, MA (1979)
Kothapalli, K., Onus, M., Scheideler, C., Schindelhauer, C.: Distributed coloring in \({O}(\sqrt{\log n})\) bit rounds. In: 20th International Parallel and Distributed Processing Symposium (IPDPS), Rhodes Island, Greece. IEEE (2006)
Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press, New York (1999)
Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., Trehan, A.: On the complexity of universal leader election. J. ACM 7, 7: 1–7: 27 (2015)
LeLann, G.: Distributed systems: Towards a formal approach. In: Gilchrist, B. (ed.), Information processing 1977, pp. 155–160. North-Holland (1977)
Lynch, N.A.: Distributed algorithms. Morgan Kaufman, San Francisco (1996)
Peleg, D.: Time-optimal leader election in general networks. J. Parallel Distrib. Comput. 8(1), 96–99 (1990)
Rosen, K.H. (ed.): Handbook of Discrete and Combinatorial Mathematics. CRC Press, Boca Raton (2000)
Santoro, N.: On the message complexity of distributed problems. Int. J. Parallel Program. 13(3), 131–147 (1984)
Santoro, N.: Design and analysis of distributed algorithm. Wiley, New York (2007)
Schneider, J., Wattenhofer, R.: Trading bit, message, and time complexity of distributed algorithms. In: Peleg, D. (ed.) Distributed Computing. LNCS, vol. 6950, pp. 51–65. Springer, Heidelberg (2011)
Segall, A.: Distributed network protocols. IEEE Trans. Inf. Theor. 29(1), 23–24 (1983)
Tanenbaum, A., van Steen, M.: Distributed Systems - Principles and Paradigms. Prentice Hall, Upper Saddle River (2002)
Tel, G.: Introduction to distributed algorithms. Cambridge University Press, Cambridge (2000)
Yao, A.C.: Some complexity questions related to distributed computing. In: Proceedings of 11th Symposium on Theory of Computing (STOC), pp. 209–213. ACM Press (1979)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Casteigts, A., Métivier, Y., Robson, J.M., Zemmari, A. (2016). Deterministic Leader Election in \(O(D+\log n)\) Time with Messages of Size O(1). In: Gavoille, C., Ilcinkas, D. (eds) Distributed Computing. DISC 2016. Lecture Notes in Computer Science(), vol 9888. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-53426-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-53426-7_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-53425-0
Online ISBN: 978-3-662-53426-7
eBook Packages: Computer ScienceComputer Science (R0)