Fault Tolerant Message Efficient Coordinator Election Algorithm in High Traffic Bidirectional Ring Network
Now-a-days use of distributed systems such as internet and cloud computing is growing dramatically. Coordinator existence in these systems is crucial due to processes coordinating and consistency requirement as well. However the growth makes their election algorithm even more complicated. Too many algorithms are proposed in this area, but the two most well-known one are Bully and Ring. In this paper, the authors propose a fault tolerant coordinator election algorithm in typical bidirectional ring topology which is twice as fast as Ring algorithm although far fewer messages are passing due to election. Fault tolerance technique is applied which leads the waiting time for the election reaching to zero.