Enhanced bully algorithm for leader node election in synchronous distributed systems

Md. Golam Murshed; Alastair R. Allen

doi:10.3390/computers1010003

Enhanced bully algorithm for leader node election in synchronous distributed systems

Md. Golam Murshed, Alastair R. Allen

Engineering

Research output: Contribution to journal › Article › peer-review

9 Citations (Scopus)

8 Downloads (Pure)

Abstract

In distributed computing systems, if an elected leader node fails, the other nodes of the system need to elect another leader. The bully algorithm is a classical approach for electing a leader in a synchronous distributed computing system. This paper presents an enhancement of the bully algorithm, requiring less time complexity and minimum message passing. This significant gain has been achieved by introducing node sets and tie breaker time. The latter provides a possible solution to simultaneous elections initiated by different nodes. In comparison with the classical algorithm and its existing modifications, this proposal generates minimum messages, stops redundant elections, and maintains fault-tolerant behaviour of the system.

Original language	English
Pages (from-to)	3-23
Number of pages	21
Journal	Computers
Volume	1
Issue number	1
Early online date	25 Jun 2012
DOIs	https://doi.org/10.3390/computers1010003
Publication status	Published - Sept 2012

Keywords

leader node election
distributed systems
bully algorithm

Access to Document

10.3390/computers1010003

computers-01-00003
This is an open access article distributed under the Creative Commons Attribution License (CC BY) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. http://creativecommons.org/licenses/by/3.0/
Final published version, 455 KB

Cite this

@article{1c52fae448b8473b8e0e128d6a8e9a90,

title = "Enhanced bully algorithm for leader node election in synchronous distributed systems",

abstract = "In distributed computing systems, if an elected leader node fails, the other nodes of the system need to elect another leader. The bully algorithm is a classical approach for electing a leader in a synchronous distributed computing system. This paper presents an enhancement of the bully algorithm, requiring less time complexity and minimum message passing. This significant gain has been achieved by introducing node sets and tie breaker time. The latter provides a possible solution to simultaneous elections initiated by different nodes. In comparison with the classical algorithm and its existing modifications, this proposal generates minimum messages, stops redundant elections, and maintains fault-tolerant behaviour of the system.",

keywords = "leader node election, distributed systems, bully algorithm",

author = "Murshed, {Md. Golam} and Allen, {Alastair R.}",

year = "2012",

month = sep,

doi = "10.3390/computers1010003",

language = "English",

volume = "1",

pages = "3--23",

journal = "Computers",

issn = "2073-431X",

publisher = "MDPI AG",

number = "1",

}

TY - JOUR

T1 - Enhanced bully algorithm for leader node election in synchronous distributed systems

AU - Murshed, Md. Golam

AU - Allen, Alastair R.

PY - 2012/9

Y1 - 2012/9

N2 - In distributed computing systems, if an elected leader node fails, the other nodes of the system need to elect another leader. The bully algorithm is a classical approach for electing a leader in a synchronous distributed computing system. This paper presents an enhancement of the bully algorithm, requiring less time complexity and minimum message passing. This significant gain has been achieved by introducing node sets and tie breaker time. The latter provides a possible solution to simultaneous elections initiated by different nodes. In comparison with the classical algorithm and its existing modifications, this proposal generates minimum messages, stops redundant elections, and maintains fault-tolerant behaviour of the system.

AB - In distributed computing systems, if an elected leader node fails, the other nodes of the system need to elect another leader. The bully algorithm is a classical approach for electing a leader in a synchronous distributed computing system. This paper presents an enhancement of the bully algorithm, requiring less time complexity and minimum message passing. This significant gain has been achieved by introducing node sets and tie breaker time. The latter provides a possible solution to simultaneous elections initiated by different nodes. In comparison with the classical algorithm and its existing modifications, this proposal generates minimum messages, stops redundant elections, and maintains fault-tolerant behaviour of the system.

KW - leader node election

KW - distributed systems

KW - bully algorithm

U2 - 10.3390/computers1010003

DO - 10.3390/computers1010003

M3 - Article

SN - 2073-431X

VL - 1

SP - 3

EP - 23

JO - Computers

JF - Computers

IS - 1

ER -

Enhanced bully algorithm for leader node election in synchronous distributed systems

Abstract

Keywords

Access to Document

Fingerprint

Cite this