FRLLE: a failure rate and load-based leader election algorithm for a bidirectional ring in distributed systems

Abstract

In a distributed system, multiple nodes work together to build a highly available, reliable, resource shareable, and fault-tolerant system to achieve a common goal. Here, multiple nodes work together to complete a task, so coordination is essential among these nodes. Electing a node as a system leader from among all the nodes can be a possible solution to do the coordination. Besides coordination, the leader also controls various activities like task allocation, result aggregation, efficient resource sharing, clock synchronization, and communication among the nodes of the system. In this work, we address the leader election problem through a new leader election algorithm called Failure Rate and Load-based Leader Election (FRLLE) algorithm for bidirectional ring networks. The proposed algorithm elects a node with a minimum failure rate and load as well so that the system gets a more reliable leader that can concentrate on leadership roles and activity comfortably. Like a proper leader election algorithm, this algorithm satisfies safety, liveness, and termination conditions that help to build an efficient and consistent distributed system. This algorithm reduces the message and time complexity, which means the algorithm takes fewer time steps to elect a leader by exchanging fewer messages. We compare the simulation results of the FRLLE algorithm with the well-known existing leader election algorithms and demonstrate that the FRLLE algorithm exchanges fewer messages and takes fewer time steps to elect the leader. We further carried out a priori complexity analysis and compared the outcome with the results of the simulation to corroborate our proposal.