Abstract
Distributed computing consists of a model where multiple parts of a system are accessed by different computing machines for the betterment of work efficiency. To get better results, electing a leader is one of the most critical tasks. Leader election is the process of assigning one of the processes as the leader whose work is to organize all the provided jobs that are distributed between the different computer nodes and to provide them with the required resources. The obstacle that is dealt with here is to elect a processor that can act like a leader from among the set of multiple processors using distributed protocols. To explain this in further detail, let us consider that we have n number of processors, and among these n processors, we have n number of processors, and among these n processors we have cn number of processors which can be considered as bad or corrupt and (1-c)n number of processors among them can be considered as good or not corrupt. Here the value of c is a fraction value and is fixed. The problem that is to be dealt with is to select a processor with a probability that has to be constant, a single processor from the given n number of processors which can act as their leader, no matter which set of the given cn processors are bad here. The scalability that is mentioned hereof leader election being scalable refers to the fact that every good or non-corrupt processor that is available amongst the total n number of processors sends and also processes several bits. And these number of bits that are being sent and processed by the various processors are polylogarithmic in n. Here we can say that the number of bits that are sent over or processed by a node belongs to a function that is polynomial in the logarithm of n.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Burman, J., Doty, D., Nowak, T., Severson, E.E., Xu, C.: Efficient self-stabilizing leader election in population protocols. CoRR, vol. abs/1907.06068 (2019). http://arxiv.org/abs/1907.06068
Gasieniec, L., Stachowiak, G.: Fast space optimal leader election in population protocols. CoRR, vol. abs/1704.07649 (2017). http://arxiv.org/abs/1704.07649
Berenbrink, P., Kaaser, D., Kling, P., Otterbach, L.: Simple and efficient leader election. In: Seidel, R. (ed.) 1st Symposium on Simplicity in Algorithms (SOSA 2018), ser. OpenAccess Series in Informatics (OASIcs), vol. 61, pp. 9:1–9:11. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018). http://drops.dagstuhl.de/opus/volltexte/2018/8302
Kim, T.W., Kim, E.H., Kim, J.K., Kim, T.Y.: A leader election algorithm in a distributed computing system. In: Proceedings of the Fifth IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems, pp. 481–485 (1995)
Singh, G.: Leader election in complete networks. In: Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, ser. PODC 1992, pp. 179–190. Association for Computing Machinery, New York (1992). https://doi.org/10.1145/135419.135457
Chow, Y., Luo, K.C.K., Newman-Wolfe, R.: An optimal distributed algorithm for failure-driven leader election in bounded-degree networks. In: Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems, pp. 136–141 (1992)
Luling, R., Monien, B., Ramme, F.: Load balancing in large networks: a comparative study. In: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, pp. 686–689 (1991)
Sanchez-Rodriguez, D., MacÃas, E., Suarez, A.: Effective load balancing on a lan-wlan cluster, pp. 473–479 (2003)
Haddad, E.: Dynamic optimization of load distribution in heterogeneous systems. In: Proceedings Heterogeneous Computing Workshop, pp. 29–34 (1994)
Ingram, R., Shields, P., Walter, J.E., Welch, J.L.: An asynchronous leader election algorithm for dynamic networks. In: IEEE International Symposium on Parallel & Distributed Processing, pp. 1–12. IEEE (2009)
Schiper, N., Toueg, S.: A robust and lightweight stable leader election service for dynamic systems. In: 2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN), pp. 207–216. IEEE (2008)
Vasudevan, S., Kurose, J., Towsley, D.: Design and analysis of a leader election algorithm for mobile ad hoc networks. In: Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004, pp. 350–360. IEEE (2004)
Ben-Or, M., Linial, N.: Collective coin flipping, robust voting schemes and minima of banzhaf values. In: 26th Annual Symposium on Foundations of Computer Science (SFCS 1985), pp. 408–416 (1985)
Linial, N., Saks, M.: Collective coin flipping and other models of imperfect randomness (1988)
Kahn, J., Kalai, G., Linial, N.: The influence of variables on boolean functions. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science, ser. SFCS 1988, pp. 68–80. IEEE Computer Society, USA (1988). https://doi.org/10.1109/SFCS.1988.21923
Saks, M.: A robust noncrytographic protocol for collective coin flipping. SIAM J. Discret. Math. 2(2), 240–244 (1989). https://doi.org/10.1137/0402020
Ajtai, M., Linial, N.: The influence of large coalitions. Combinatorica 13, 129–145 (1993)
Alon, N., Naor, M.: Coin-flipping games immune against linear-sized coalitions. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, ser. SFCS 1990, pp. 46–54. IEEE Computer Society, USA (1990). https://doi.org/10.1109/FSCS.1990.89523
Dolev, D., Fischer, M., Fowler, R., Lynch, N., Strong, H.: An efficient algorithm for byzantine agreement without authentication. Inf. Control 52, 257–274 (1982)
Feige, U.: Noncryptographic selection protocols. In: Proceedings of 40th IEEE Foundations of Computer Science (FOCS) (1999)
Ostrovsky, R., Rajagopalan, S., Vazirani, U.: Simple and efficient leader election in the full information model. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, ser. STOC 1994, pp. 234–242. Association for Computing Machinery, New York (1994). https://doi.org/10.1145/195058.195141
Bracha, G.: An o(log n) expected rounds randomized byzantine generals protocol. J. ACM 34, 910–920 (1987)
King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable leader election, pp. 990–999 (2006)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Rani, R., Rashpa, S., Mahato, D.P., Pham, V.H. (2021). Scalable Leader Election Considering Load Balancing. In: Barolli, L., Woungang, I., Enokido, T. (eds) Advanced Information Networking and Applications. AINA 2021. Lecture Notes in Networks and Systems, vol 227. Springer, Cham. https://doi.org/10.1007/978-3-030-75078-7_27
Download citation
DOI: https://doi.org/10.1007/978-3-030-75078-7_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-75077-0
Online ISBN: 978-3-030-75078-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)