Lea-TN: leader election algorithm considering node and link failures in a torus network

Biswas, Amit; Tripathi, Anil Kumar; Aknine, Samir

doi:10.1007/s11227-021-03803-7

Cited by 8 publications

(7 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For this comparison, to find the time and communication complexities of the existing methods, we implement those methods in our considered system model, and the comparisons are summarized in Table 7. Table 7 shows that the stabilization time of the proposed leader election method, Lea-TN [5], NoKfRLE [27] and FRLLE [4] is polynomial. However, the stabilization time of the SSLF [10] is exponential.…”

Section: Comparison With Existing Methodsmentioning

confidence: 99%

“…It is a low energy consuming and fault-tolerant leader election algorithm. In [5], Biswas et al introduced a leader election algorithm for a 2D torus network that can tolerate n − 2…”

Section: Related Workmentioning

confidence: 99%

“…So it creates M QF M [0.69, 5, 5] message (using self-information) and sends it to nodes 3 and 6. After receiving AGM [2,5] message from node 5, the node6 gets to know that it has only one co-parent node and no child node. So it also creates M QF M [0.74, 6, 6] message (using self-information) and sends it to node 5 (as shown in Fig.…”

Section: Illustrative Examplementioning

confidence: 99%

See 2 more Smart Citations

Multi-attribute based self-stabilizing algorithm for leader election in distributed systems

Biswas,

Singh,

Baranwal

et al. 2023

Preprint

Self Cite

View full text Add to dashboard Cite

Cloud computing, edge computing, replicated databases, and various modern technologies are adopting distributed computing concepts for a reliable, high-performance, large-scale computational platform. In distributedcomputing, leader election is a fundamental problem because the elected leader helps coordinate andutilize the resources efficiently. Several state-of-the-art works mentioned that a good quality leader is essentialas it improves system performance, simplifies management procedures, reduces coordinational complexity, andmakes the system more fault-tolerant. However, designing a self-stabilizing leader election algorithm with weakassumptions in a failure-prone distributed environment is challenging. This paper proposes a multi-attributebased,self-stabilizing, network partition-tolerant leader election method for failure-prone distributed systems.Here, based on the system requirements, the pertinent attributes of a good quality leader are identified and assignedweights according to their importance. Then the identified attributes and their weight are used to elect asuitable node as the leader.We show that the algorithm is self-stabilizing and can tolerate multiple nodes and linkfailures. Further, we analyze the proposed algorithm’s time, communication, and bit complexities. We consider adistributed database system scenario to simulate the proposed method and compare it with existing approachesto evaluate and validate the proposed method’s performance and the elected leader’s quality.

show abstract

Section: Comparison With Existing Methodsmentioning

confidence: 99%

“…It is a low energy consuming and fault-tolerant leader election algorithm. In [5], Biswas et al introduced a leader election algorithm for a 2D torus network that can tolerate n − 2…”

Section: Related Workmentioning

confidence: 99%

Section: Illustrative Examplementioning

confidence: 99%

See 1 more Smart Citation

Multi-attribute based self-stabilizing algorithm for leader election in distributed systems

Biswas,

Singh,

Baranwal

et al. 2023

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Amit et al proposed the Fault-Resistant Leader Election (FRLLE) algorithm, which elects a reliable node that can effectively manage leadership roles [17]. This algorithm satisfies safety, liveness, and termination properties, while also offering lower computation and communication costs.…”

Section: Related Workmentioning

confidence: 99%

“…Faults and failures within the election algorithm can significantly impact both communication and computation costs [14,15]. Classical election algorithms, typically utilizing the extrema-finding method, do not consider any nodal attributes representing the node's credibility [16,17]. Yet, the consideration of such nodal attributes, such as battery percentage in mobile ad hoc networks, is critical, highlighting the necessity for their integration into the election process [18,19].…”

Section: Introductionmentioning

confidence: 99%

A Robust, Preference-Based Coordinator Election Algorithm for Distributed Systems

Supase,

Pansare

2023

ISI

View full text Add to dashboard Cite

In peer-to-peer distributed systems, the selection of a reliable coordinator is a pivotal process, often vulnerable to node failure and communication link failure. Herein, we present an innovative Fault-Tolerant Coordinator Election Algorithm (FTCEA) designed to address these issues, specifically crafted to withstand node failures in peer-to-peer distributed systems. Our algorithm distinguishes itself by capitalizing on a unique preference-based method, which incorporates significant nodal attributes into the election process. This integration of nodal attributes contributes to the election of a durable and reliable coordinator, significantly enhancing the robustness of the system. A comprehensive analysis was conducted to measure FTCEA's communication complexity, execution time, and space complexity using a peer-to-peer distributed application. The results demonstrated that FTCEA successfully identifies a coordinator node with a communication cost of O(n) messages and a space complexity linear to the number of attributes, represented as O(n.m). Remarkably, FTCEA demonstrated an approximately 50.10% improvement in communication cost compared to the enhanced Bully algorithm, a widely utilized method in this domain. Moreover, FTCEA can maintain a linear storage cost of O(n), thereby significantly improving the computation cost. In summary, FTCEA offers a scalable and efficient solution for coordinator election in distributed systems, showing promising potential for practical applications in the field. The algorithm's unique design, robustness, and efficiency make it a valuable contribution to the advancement of peer-to-peer distributed systems.

show abstract

Preselection Based Leader Election in Distributed Systems

Biswas

Tripathi

2022

Intelligent Distributed Computing XIV

View full text Add to dashboard Cite

Lea-TN: leader election algorithm considering node and link failures in a torus network

Cited by 8 publications

References 35 publications

Multi-attribute based self-stabilizing algorithm for leader election in distributed systems

Multi-attribute based self-stabilizing algorithm for leader election in distributed systems

A Robust, Preference-Based Coordinator Election Algorithm for Distributed Systems

Preselection Based Leader Election in Distributed Systems

Contact Info

Product

Resources

About