|
|
| |
| In Search of a faster Consensus Algorithm (HSEB)
Download PDF
|
Salah M. Ahmed, Emad Abu Alsaid, Bahaa Shtewi, Prof. Hatem Hamad
|
Abstract:
As our lives increasingly move into the digital space and the internet becomes more ubiquitous, the need for reliable and scalable distributed systems becomes more pressing. In such systems, achieving consensus among multiple servers in the event of a system failure is a critical issue. Two popular algorithms, Paxos and Raft, have been developed to address this problem. While both algorithms have similar performance, Raft is considered simpler than Paxos. However, Raft can encounter difficulties with multiple rounds of leader elections when network delays occur, and the use of a random timeout machine cannot control the participation of candidate nodes in the election process simultaneously. To solve this issue, a novel algorithm is presented in this paper that eliminates the leader election process and selects the leader based on its NodeID number, generated using a timestamp and the MAC address of the node. This approach is expected to improve performance and reduce the time needed for leader appointments.
|
|
|
| | |