Leader Election in a Cluster using Zookeeper

Abstract

This paper presents an algorithm for flexible and fast leader election in distributed systems using Apache Zookeeper for configuration management. The algorithm proposed in this paper is designed for applications that do not use symmetric nodes so they need a specialized election process or for applications that require a more flexible approach in the leader election process. The algorithm proposes a different approach as it allows assigning prioritizations for servers in the cluster that are candidates to become a leader. The algorithm is flexible as it takes into consideration during the leader election process of the different server settings and roles, network properties, communication latency or specific application requirements. Received by the editors: 25 September 2020. 2010 Mathematics Subject Classification. 68U99. 1998 CR Categories and Descriptors. C.2.4 [Computer-Communication Network]:Distributed Systems – Distributed applications;

Keywords

• leader election, algorithm, cluster, ZooKeeper.