Enhanced bully algorithm for leader node election in synchronous distributed systems

Md. Golam Murshed, Alastair R. Allen

Research output: Contribution to journalArticle

3 Citations (Scopus)
4 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 languageEnglish
Pages (from-to)3-23
Number of pages21
JournalComputers
Volume1
Issue number1
Early online date25 Jun 2012
DOIs
Publication statusPublished - Sep 2012

Fingerprint

Distributed computer systems
Message passing

Keywords

  • leader node election
  • distributed systems
  • bully algorithm

Cite this

Enhanced bully algorithm for leader node election in synchronous distributed systems. / Murshed, Md. Golam; Allen, Alastair R.

In: Computers, Vol. 1, No. 1, 09.2012, p. 3-23.

Research output: Contribution to journalArticle

@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 = "9",
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

VL - 1

SP - 3

EP - 23

JO - Computers

JF - Computers

SN - 2073-431X

IS - 1

ER -