New Election Algorithm based on Assistant in Distributed Systems
Mahdi Zargarnataj · 2007
In distributed computing systems, a process or node as a leader used to coordinate some tasks. Leader election is influential as performance of other nodes depends on leader's ability in making its responsibilities. Conventional algorithms for leader election present particular methods to resolve any leader crash. We introduce a new method based on electing a leader and assistant. If the leader crash, the assistant takes, care of the leader's responsibilities. Our results revealed that often, after a leader crash, leader assistant elect as a leader and continue to work. This is important when the scale of network increases.