Abstract
We study smoothed analysis of the leader election (LE) problem in distributed networks. Smoothed analysis is a hybrid between worst-case analysis and average-case analysis. It takes a worst-case instance for the algorithm and perturbs the input by adding some random noise and analyzes the algorithm on this perturbed input. We consider smoothed analysis, in which the topology of the input graph G is randomly perturbed by adding random edges to G. The complexity of the algorithm is parameterized by a smoothing parameter \(0 \le \epsilon (n) \le 1\) which controls the amount of random edges to be added to the input graph G per round, where \(\epsilon \) is a small function of n, e.g., \(n^{-4}\) (n is the number of nodes in the graph G). Informally, \(\epsilon \) is the probability that a random edge can be added to a node per round.
We analyze the time and message complexity of leader election in the above smoothing model. We present the following three results in synchronous CONGEST distributed model:
-
(i)
A simple randomized algorithm that elects a leader with high probability (With high probability (or w.h.p. in short) means with probability \(\ge 1-1/n\).) in \(O((\log n)/\epsilon )\) rounds and uses \(O(\sqrt{n}\log ^{2.5} n)\) messages. Note that both the time and the message bounds are optimal (up to a \(\text {polylog}\, n\) factor).
-
(ii)
A time-improved randomized algorithm that elects a leader with high probability in \(O\left( \frac{\log n}{\sqrt{\epsilon }}\right) \) rounds, but uses \(O(m + n\log n)\) messages, where m is the number of edges in the input graph G.
-
(iii)
A deterministic algorithm (except the randomized smoothing part) which solves leader election in \(O\left( \frac{\log ^2 n}{\sqrt{\epsilon }}\right) \) rounds and incurs \(O(m + n\sqrt{\epsilon }\log ^2 n)\) messages.
Our work extends the study of smoothed analysis of distributed problems one step further, an open direction raised by [7].
Keywords
The work is supported, in part, by a project on IoT Security, funded by Govt. of India at R. C. Bose Centre for Cryptology and Security, Kolkata, India.
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 subscriptionsNotes
- 1.
Since \(|V'| = O(n\sqrt{\epsilon })\), it would suffice to sample \(O(\sqrt{n\sqrt{\epsilon }\log n})\) referee nodes to ensure a common referee node between any pair of candidate super-nodes.
References
Afek, Y., Gafni, E.: Time and message bounds for election in synchronous and asynchronous complete networks. SIAM J. Comput. 20(2), 376–394 (1991)
Anderson, D.P., Kubiatowicz, J.: Introduction to distributed algorithms. The worldwide computer. Sci. Am. 286(3), 28–35 (2002)
Angel, O., Bubeck, S., Peres, Y., Wei, F.: Local max-cut in smoothed polynomial time. In: STOC (2017)
Arthur, D., Manthey, B., Röglin, H.: Smoothed analysis of the k-means method. J. ACM 58(5), 1–31 (2011)
Augustine, J., Molla, A.R., Pandurangan, G.: Sublinear message bounds for randomized agreement. In: PODC, pp. 315–324. ACM (2018)
Blum, A., Hopcroft, J., Kannan, R.: Foundations of Data Science. Cambridge University Press (2020). https://doi.org/10.1017/9781108755528
Chatterjee, S., Pandurangan, G., Pham, N.D.: Distributed MST: a smoothed analysis. In: ICDCN, pp. 15:1–15:10 (2020)
Dinitz, M., Fineman, J., Gilbert, S., Newport, C.: Smoothed analysis of dynamic networks. In: Moses, Y. (ed.) DISC 2015. LNCS, vol. 9363, pp. 513–527. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48653-5_34
Elsässer, R., Tscheuschner, T.: Settling the complexity of local max-cut (almost) completely. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 171–182. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22006-7_15
Etscheid, M., Röglin, H.: Smoothed analysis of local search for the maximum-cut problem. ACM Trans. Algorithms 13(2), 1–12 (2017)
Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5(1), 66–77 (1983)
Gilbert, S., Robinson, P., Sourav, S.: Leader election in well-connected graphs. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 227–236 (2018)
Humblet, P.: Electing a leader in a clique in o(n log n) messages. Intern. Memo., Laboratory for Information and Decision Systems. M.I.T., Cambridge, MA (1984)
Kadjouh, N., et al.: A dominating tree based leader election algorithm for smart cities IoT infrastructure. Mob. Netw. Appl., 1–14 (2020). https://doi.org/10.1007/s11036-020-01599-z
Khan, M., Kuhn, F., Malkhi, D., Pandurangan, G., Talwar, K.: Efficient distributed approximation algorithms via probabilistic tree embeddings. Distrib. Comput. 25(3), 189–205 (2012). https://doi.org/10.1007/s00446-012-0157-9
Korach, E., Kutten, S., Moran, S.: A modular technique for the design of efficient distributed leader finding algorithms. ACM Trans. Program. Lang. Syst. 12(1), 84–101 (1990)
Korach, E., Moran, S., Zaks, S.: The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors. SIAM J. Comput. 16(2), 231–236 (1987)
Korach, E., Moran, S., Zaks, S.: Optimal lower bounds for some distributed algorithms for a complete network of processors. Theor. Comput. Sci. 64(1), 125–132 (1989)
Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., Trehan, A.: On the complexity of universal leader election. J. ACM 62(1), 7:1–7:27 (2015)
Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., Trehan, A.: Sublinear bounds for randomized leader election. Theor. Comput. Sci. 561, 134–143 (2015)
Kutten, S., Zinenko, D.: Low communication self-stabilization through randomization. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 465–479. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15763-9_45
Lann, G.L.: Distributed systems - towards a formal approach. In: Information Processing, Proceedings of the 7th IFIP Congress 1977, pp. 155–160 (1977)
Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. American Mathematical Society, Providence (2006)
Pandurangan, G.: Distributed network algorithms (2018). http://sites.google.com/site/gopalpandurangan/dnabook.pdf
Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia (2000)
Rahman, M.U.: Leader election in the Internet of Things: challenges and opportunities. CoRR abs/1911.00759 (2019). http://arxiv.org/abs/1911.00759
Ratnasamy, S., Francis, P., Handley, M., Karp, R.M., Shenker, S.: A scalable content-addressable network. In: SIGCOMM, pp. 161–172. ACM (2001)
Roughgarden, T.: Beyond worst-case analysis. Commun. ACM 62(3), 88–96 (2019)
Shi, E., Perrig, A.: Designing secure sensor networks. IEEE Wirel. Commun. 11(6), 38–43 (2004)
Singh, G.: Efficient distributed algorithms for leader election in complete networks. In: ICDCS, pp. 472–479. IEEE Computer Society (1991)
Spielman, D.A., Teng, S.H.: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. J. ACM 51(3), 385–463 (2004)
Wright, A.: Contemporary approaches to fault tolerance. Commun. ACM 52(7), 13–15 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Molla, A.R., Shur, D. (2020). Smoothed Analysis of Leader Election in Distributed Networks. In: Devismes, S., Mittal, N. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2020. Lecture Notes in Computer Science(), vol 12514. Springer, Cham. https://doi.org/10.1007/978-3-030-64348-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-64348-5_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-64347-8
Online ISBN: 978-3-030-64348-5
eBook Packages: Computer ScienceComputer Science (R0)