Abstract
Today mostly all applications are designed to be distributed. The main intention behind it is to avoid losses due to the failure of the central entity in centralized systems. The key element in distributed systems is coordinator or leader entity. Coordinator plays critical role in distributed systems, specially for performing tasks like simplifying process synchronization and load balancing. Hence electing one of the entities as a coordinator is an important problem. But in practice, coordinator election process in distributed systems is vulnerable to faults and failures hence it is necessary to design a coordinator election algorithm to tolerate faults and failures. In this paper, the notion of fault tolerant Election Quorum (further termed as ‘EQuorum’) method for coordinator election is introduced. The challenges in the existing algorithms are identified and proposed an EQuorum-based fault tolerant coordinator election algorithm. This algorithm can tolerate failure of communication links and entities. The number of messages, time to terminate algorithm and failover time of the proposed algorithm are identified, evaluated and analysed. Thus, this paper proposes a fault-tolerant coordinator election algorithm for partially synchronous distributed systems which outperforms in message and time performance measures. It is observed that EQuorum outperforms as compared to existing election algorithms and provides additional feature of fault tolerance.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Deshpande, P., Sharma, S.C., Peddoju, S.K.: Data storage security in cloud paradigm. In: Fifth International Conference on Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol. 436, pp. 247–259 (2016)
Soundarabai, P., Triveni, J., Venugopal, K., Patanaik, L.: An improved leader election algorithm for distributed systems. Int. J. Next Gen. Netw. (IJNGN) 5, 21–29 (2013)
Rachid, G., Matej, P., Dragos-Adrian, S.: Blockchain protocol: adversary is in the details. In: Symposium on Foundation and Applications of Blockchain (FAB), Los Angeles, California USA, pp. 24–30 (2018)
Lynch, N.: Distributed Algorithms, 1st edn. Morgan Kaufman, ELSEVIER Science India (1996)
Molina, H.: Election in a distributed computing system. IEEE Trans. Comput. 31, 48–59 (1982)
Sinha, P.: Distributed Operating Systems Concepts and Design. Prentice-Hall of India Private Limited (2008)
Daymude, J., Gmyr, R., Richa, A., Strothmann, T.: Improved leader election for self-organizing programmable matter. Distrib. Parallel Cluster Comput. 1–11 (2017)
Gmez-Calzado, C., Lafuente, A., Larrea, M., Raynal, M.: Fault-tolerant leader election in mobile dynamic distributed systems. In: IEEE 19th Pacific Rim International Symposium on Dependable Computing, pp. 78–87 (2013)
Rafailescu, M.: Fault tolerant leader election in distributed systems. Int. J. Comput. Sci. Inf. Technol. 9, 13–20 (2017)
Sidik, B., Puzis, R., Zilberman, P., Elovici, Y.: PALE: partially asynchronous agile leader election, distributed computing. IEEE, pp. 1–13 (2018)
Manas, Y., Namratha, D., Mounika, Y.: A comprehensive survey on real time application of paxos algorithm. Int. J. Comput. Netw. Wirel. Commun. (IJCNWC) 8, 60–65 (2018)
Casteights, A., Metivier, Y., Robson, J.M., Zemmari, A.: Deterministic leader election takes \((D + Logn)\) bit rounds. DISC 3, 1–18 (2017)
Blin, L., Tixeuil, S.: Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative. Distrib. Comput. 4, 1–42 (2017)
Derhab, A., Badache, N.: A self-stabilizing leader election algorithm in highly dynamic ad hoc mobile networks. IEEE Trans. Parallel Distrib. Syst. 19, 926–939 (2008)
Refai, M., Alkheder, K., Aloqaily, I.: Leader election algorithm in honeycomb torus network. J. Eng. Technol. 5, 72–92 (2016)
Leszek G., Grzegorz, S.: Fast space optimal leader election in population protocols. In: SODA 2018 Proceedings, pp. 2653–2667 (2018)
Kola, G., Kosar, T., Livny, M.: Faults in large distributed systems and what we can do about them. In: European Conference on Parallel Processing, pp. 1–10 (2009)
Mostfaoui, A., Moumen, H., Raynal, M.: Randomized K-set agreement in crash-prone and byzantine asynchronous systems. Elsevier B.V., pp. 1–18 (2017)
Fernndez-Campusano, C., Larrea, M., Cortias, R., Raynal, M.: A distributed leader election algorithm in crash-recovery and omissive systems. Inf. Process. Lett. 100–104 (2017)
Supase, S., Ingle, R.: Performance analysis of sponsor selection algorithms in group key agreement. IJCA 5, 1–6 (2011). Special Issue on Network Security and Cryptography NSC
Ingle, R., Shivkumar, G.: Tunable group key agreement. In: 32nd IEEE Conference on Local Computer Networks, pp. 1017–1024 (2017)
David, D., David, S.: Stable leader election in population protocols requires linear time. Distrib. Comput. 31, 257–271 (2018)
Jackson, S.: Models of leader election and their applications. Doctoral Dissertation, MISSOURI University of Science and Technology, Missouri, pp. 1–111 (2016)
Vasudevan, S., DeCleene, B., Kurose, J., Towsley, D.: Secure leader election in wireless ad hoc network. Umass Computer Science Technical Report, UM-CS-2001-050, pp. 1–50 (2001)
Tel, G.: Introduction to Distributed Algorithms. Cambridge Publication (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Supase, S., Ingle, R. (2020). Election-Quorum-Based Coordinator Election Algorithm for Distributed Systems. In: Iyer, B., Deshpande, P., Sharma, S., Shiurkar, U. (eds) Computing in Engineering and Technology. Advances in Intelligent Systems and Computing, vol 1025. Springer, Singapore. https://doi.org/10.1007/978-981-32-9515-5_12
Download citation
DOI: https://doi.org/10.1007/978-981-32-9515-5_12
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-32-9514-8
Online ISBN: 978-981-32-9515-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)