A Novel Weight-based Leader Election Approach for Split Brain in Distributed System

Abstract

The rapid development of High Availability (HA) system has attracted growing attention from both industry and academia. Due to the network and hardware failure, a complete system would split into two or more separate partitions, which begin to compete for shared resources, resulting in system chaos and data corruption. In this paper, we propose a novel weight-based leader election approach for split brain in a distributed system. The leader of separate partitions would be elected by embedding an arbitration program in the client. Unlike the traditional mode, the leader election in our proposed approach is lightweight and fully automatic, meaning that no additional hardware resources or manual intervention are required. The approach presented in this paper has been validated to be valid through qualitative and quantitative experiments.

A novel algorithm for secure and reliable coordinator election in distributed networks

“…As the entities in the system are networked and use message passing technique for communication and execution of distributed election algorithm, electing a reliable entity as a coordinator is a challenge. The unreliable communication channel used in message passing makes the election algorithm vulnerable to security attacks [7,8] The unauthorized access may result in a security and privacy attack which includes the impersonation and denial of voting attack [9,10].…”