PALE: Time Bounded Practical Agile Leader Election

Sidik, Bronislav; Puzis, Rami; Zilberman, Polina; Elovici, Yuval

doi:10.1109/tpds.2019.2933620

Cited by 5 publications

(7 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [18], [31] for partially asynchronous and dynamic systems. Here the assumption regarding clock drift is strong.…”

Section: Related Workmentioning

confidence: 99%

“…The authors considered a dynamic system where nodes can leave or join the system frequently while selecting the perfect value of maxRatio is quite tricky. In [31], a node with the highest rank is elected as a leader. However, it is not detailed how the rank will be calculated.…”

Section: Related Workmentioning

confidence: 99%

“…Several existing well-known leader election algorithms talked about electing a good quality leader [33] [6] [5] [31]. However, no precise and rigorous leader election method has been proposed to elect a good quality leader based on the system requirements.…”

Section: Introductionmentioning

confidence: 99%

“…On the other hand, an arbitrary topology-based asynchronous and continuous link and node failure-recovery distributed system represents a robust and realistic distributed environment. However, designing a self-stabilizing leader election algorithm in such a distributed system is impossible [31]. So an arbitrary topology-based, failure-prone distributed system that lies between the synchronous and asynchronous systems is more realistic and suitable to deploy new technologies that want to adopt distributed computing for a reliable, high-performance, and large-scale computational platform.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Multi-attribute based self-stabilizing algorithm for leader election in distributed systems

Biswas,

Singh,

Baranwal

et al. 2023

Preprint

View full text Add to dashboard Cite

Cloud computing, edge computing, replicated databases, and various modern technologies are adopting distributed computing concepts for a reliable, high-performance, large-scale computational platform. In distributedcomputing, leader election is a fundamental problem because the elected leader helps coordinate andutilize the resources efficiently. Several state-of-the-art works mentioned that a good quality leader is essentialas it improves system performance, simplifies management procedures, reduces coordinational complexity, andmakes the system more fault-tolerant. However, designing a self-stabilizing leader election algorithm with weakassumptions in a failure-prone distributed environment is challenging. This paper proposes a multi-attributebased,self-stabilizing, network partition-tolerant leader election method for failure-prone distributed systems.Here, based on the system requirements, the pertinent attributes of a good quality leader are identified and assignedweights according to their importance. Then the identified attributes and their weight are used to elect asuitable node as the leader.We show that the algorithm is self-stabilizing and can tolerate multiple nodes and linkfailures. Further, we analyze the proposed algorithm’s time, communication, and bit complexities. We consider adistributed database system scenario to simulate the proposed method and compare it with existing approachesto evaluate and validate the proposed method’s performance and the elected leader’s quality.

show abstract

“…In [18], [31] for partially asynchronous and dynamic systems. Here the assumption regarding clock drift is strong.…”

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Multi-attribute based self-stabilizing algorithm for leader election in distributed systems

Biswas,

Singh,

Baranwal

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…The election Sidik et al [18] have proposed the Practical Agile Leader Election (PALE) algorithm which terminates in bounded time. PALE operates with desynchronized clocks and jittering nodes.…”

Section: Literature Reviewmentioning

confidence: 99%

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

Supase¹,

Ingle²

2021

IJATEE

View full text Add to dashboard Cite

Electing a reliable coordinator is a crucial task in peer-to-peer distributed network. The peer-to-peer distributed network comprises a number of peer entities. These member entities elect the coordinator entity by consensus [1][2][3]. Different consensus algorithms exist for electing an entity as a coordinator and those are generally termed as coordinator election algorithms. The majority of the existing election algorithms focus on improving the performance measures in particular communication cost [4][5][6]. 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].

show abstract

Election-Quorum-Based Coordinator Election Algorithm for Distributed Systems

Supase¹,

Ingle²

2019

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

PALE: Time Bounded Practical Agile Leader Election

Cited by 5 publications

References 47 publications

Multi-attribute based self-stabilizing algorithm for leader election in distributed systems

Multi-attribute based self-stabilizing algorithm for leader election in distributed systems

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

Election-Quorum-Based Coordinator Election Algorithm for Distributed Systems

Contact Info

Product

Resources

About