A novel leader election mechanism for distributed systems using dynamic priority scores

P. Remya Krishnan

International Journal of Information Technology and Management, 2026, vol. 25, issue 1, 73-88

Abstract: Efficient coordination in distributed systems relies on selecting a suitable leader node, a process often challenged by asynchronous operations and node failures. Traditional leader election algorithms struggle with scalability and fault tolerance, necessitating more adaptive approaches to address these challenges. This paper introduces priority enhanced quorum consensus (PEQC), a novel leader election mechanism that integrates dynamically computed priority scores with quorum-based decision making. By utilising priority-based selection, PEQC ensures the election of the most suitable node while addressing node downtime and enhancing system responsiveness. A comparative analysis with existing algorithms demonstrates PEQC's superior performance in reducing election overhead, improving fault recovery, and ensuring fair leadership distribution.

Keywords: leader election; distributed systems; dynamic priority; quorum consensus; scalability; fault tolerance. (search for similar items in EconPapers)
Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.inderscience.com/link.php?id=152453 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijitma:v:25:y:2026:i:1:p:73-88

Access Statistics for this article

More articles in International Journal of Information Technology and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().