Fault Tolerant Leader Election in Distributed Systems
Marius Rafailescu

TL;DR
This paper introduces a novel fault-tolerant leader election algorithm for distributed systems that utilizes a random roulette wheel selection method to ensure system resilience during failures.
Contribution
The paper presents a new leader election algorithm based on roulette wheel selection, enhancing fault tolerance in distributed systems.
Findings
The algorithm successfully elects new leaders during faults.
It improves fault tolerance compared to existing methods.
The approach is simple and effective in distributed environments.
Abstract
There are many distributed systems which use a leader in their logic. When such systems need to be fault tolerant and the current leader suffers a technical problem, it is necesary to apply a special algorithm in order to choose a new leader. In this paper I present a new fault tolerant algorithm which elects a new leader based on a random roulette wheel selection.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
