A Leader Election Protocol for Timed Asynchronous Distributed Systems

2006 ◽  
pp. 877-886
Author(s):  
Amirhasan Amintabar ◽  
Alexander Kostin ◽  
Ljudmila Ilushechkina
Keyword(s):  
Distributed Systems ◽  
Leader Election

A Novel Hypergraph-Based Leader Election Algorithm for Distributed Systems

2020 ◽  
pp. 437-445
Author(s):  
E. R. S. Subramanian ◽  
B. Sri Gurubaran ◽  
A. S. Sayee Shruthi ◽  
V. Aishwarya ◽  
N. Balaji ◽  
...  
Keyword(s):  
Distributed Systems ◽  
Leader Election ◽  
Election Algorithm ◽  
Leader Election Algorithm

Leader election in asynchronous distributed systems

2000 ◽  
Vol 49 (3) ◽  
pp. 283-284 ◽  
Author(s):  
S.D. Stoller
Keyword(s):  
Distributed Systems ◽  
Leader Election

Message Efficient Ring Leader Election in Distributed Systems

2013 ◽  
pp. 835-843 ◽  
Author(s):  
P. Beaulah Soundarabai ◽  
J. Thriveni ◽  
H. C. Manjunatha ◽  
K. R. Venugopal ◽  
L. M. Patnaik
Keyword(s):  
Distributed Systems ◽  
Leader Election

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

2020 ◽  
Vol 77 (1) ◽  
pp. 751-779
Author(s):  
Amit Biswas ◽  
Ashish Kumar Maurya ◽  
Anil Kumar Tripathi ◽  
Samir Aknine
Keyword(s):  
Distributed Systems ◽  
Failure Rate ◽  
Leader Election ◽  
Election Algorithm ◽  
Leader Election Algorithm

scholarly journals Leader Election in a Cluster using Zookeeper

2021 ◽  
Vol 66 (1) ◽  
pp. 104
Author(s):  
M. Petrescu
Keyword(s):  
Distributed Systems ◽  
Configuration Management ◽  
Leader Election ◽  
Flexible Approach ◽  
Communication Latency ◽  
Election Process ◽  
Network Properties ◽  
Application Requirements

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.

Sign in / Sign up

Export Citation Format

Share Document