3 -Phase Leader Election Algorithm for Distributed Systems
| Autor: | Siva Sankar Rao. S, Aparna Rajesh Atmakuri, Pushya Chaparala |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Leader election
Distributed Computing Environment Computer science Node (networking) Distributed computing Process (computing) 020206 networking & telecommunications 02 engineering and technology Phase (combat) Prime (order theory) Communication in small groups 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Communication complexity |
| Zdroj: | 2019 3rd International Conference on Computing Methodologies and Communication (ICCMC). |
| Popis: | Election plays a foremost part in distributed systems. The reason behind the Election process in distributed system is to optimize in terms of load and improving the efficiency of the system there by improving the process of group communication. Choosing a node to be a leader in a distributed environment is intricate. Over years, there are so much of exploitations in the existing techniques such as ring and bully but these algorithms could not able to provide an appropriate solution in terms of message complexity. In this paper, we proposed a novel method known as "3-Phase Leader Election Algorithm" that consists of three phases. Firstly, it identifies and filters the nodes for election. Secondly, the filtered nodes are been validated for determination of prime node via which the group communication takes place. Finally, the Prime node will be identified and accepted in the acceptance phase. Our approach is based on understanding the complexity involved behind a message and improving the efficiency of the system via following performance metrics such as Time and Communication complexity. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|