A bi-directional election algorithm based on ring topology

In a distributed system, when the coordinator is not functioning, the system needs to elect a new coordinator to enable the active node to perform useful tasks. In this paper, a bi-directional election algorithm based on ring topology was brought forward after we analyzed a classical distributed election algorithm. The new algorithm could quickly elect the coordinator by sending messages in parallel. Study shows that the new algorithm takes less time to elect a new coordinator to enable the system quickly to operate normally.