A secured and fault-tolerant algorithm for electing an efficient coordinator in distributed networks

• A Reliable and Stable Coordinator Election Algorithm in Distributed Systems (RSCEA) is proposed and design to withstand node failures and security threats during the election process. • A preference-based voting mechanism is a key highlight that incorporates essential nodal characteristics into the election procedure. By including nodal properties, the system's robustness is greatly increased, and a long-lasting and dependable coordinator is elected. • The complexity of the RSCEA space, execution time and communication complexity were examined thoroughly • RSCEA demonstrates scalability with a storage expense linear in number of nodes, thus markedly enhancing communication efficiency. • RSCEA elects a reliable and stable coordinator in distributed networks. • Its distinctive design, resilience, and effectiveness make it an important asset in the progression of distributed systems. Selecting a reliable and stable coordinator is a crucial aspect of distributed systems, often vulnerable to node failures and security breaches. In response to these challenges, we present the Reliable and Stable Coordinator Election Algorithm in Distributed Systems (RSCEA). This algorithm is designed to withstand node failures and security threats during the election process. A key highlight of our approach is the utilization of a preference-based voting mechanism that incorporates essential nodal characteristics into the election procedure. By including nodal properties, the system's robustness is greatly increased, and a long-lasting and dependable coordinator is elected. The complexity of the RSCEA space, execution time and communication complexity were thoroughly examined. The findings show that RSCEA effectively selects a coordinator with linear message complexity proportional to the number of nodal features, denoted as O(n.m) where n is number of nodes and m indicates the number of attributes. RSCEA demonstrates scalability with a storage expense linear in number of nodes, thus markedly enhancing communication efficiency. RSCEA elects a reliable and stable coordinator in distributed networks. Its distinctive design, resilience, and effectiveness make it an important asset in the progression of distributed systems.

Authors

Institutions

Publication Details

Journal
e-Prime - Advances in Electrical Engineering Electronics and Energy
Published
2024-09-26
DOI
https://doi.org/10.1016/j.prime.2024.100791
Primary Topic
Distributed systems and fault tolerance
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A secured and fault-tolerant algorithm for electing an efficient coordinator in distributed networks

Shital Subhashchandra Supase, Jayshree Rahul Pansare
e-Prime - Advances in Electrical Engineering Electronics and Energy
Distributed systems and fault tolerance
article

A secured and fault-tolerant algorithm for electing an efficient coordinator in distributed networks

Shital Subhashchandra Supase, Jayshree Rahul Pansare
article en

Abstract

• A Reliable and Stable Coordinator Election Algorithm in Distributed Systems (RSCEA) is proposed and design to withstand node failures and security threats during the election process. • A preference-based voting mechanism is a key highlight that incorporates essential nodal characteristics into the election procedure. By including nodal properties, the system's robustness is greatly increased, and a long-lasting and dependable coordinator is elected. • The complexity of the RSCEA space, execution time and communication complexity were examined thoroughly • RSCEA demonstrates scalability with a storage expense linear in number of nodes, thus markedly enhancing communication efficiency. • RSCEA elects a reliable and stable coordinator in distributed networks. • Its distinctive design, resilience, and effectiveness make it an important asset in the progression of distributed systems. Selecting a reliable and stable coordinator is a crucial aspect of distributed systems, often vulnerable to node failures and security breaches. In response to these challenges, we present the Reliable and Stable Coordinator Election Algorithm in Distributed Systems (RSCEA). This algorithm is designed to withstand node failures and security threats during the election process. A key highlight of our approach is the utilization of a preference-based voting mechanism that incorporates essential nodal characteristics into the election procedure. By including nodal properties, the system's robustness is greatly increased, and a long-lasting and dependable coordinator is elected. The complexity of the RSCEA space, execution time and communication complexity were thoroughly examined. The findings show that RSCEA effectively selects a coordinator with linear message complexity proportional to the number of nodal features, denoted as O(n.m) where n is number of nodes and m indicates the number of attributes. RSCEA demonstrates scalability with a storage expense linear in number of nodes, thus markedly enhancing communication efficiency. RSCEA elects a reliable and stable coordinator in distributed networks. Its distinctive design, resilience, and effectiveness make it an important asset in the progression of distributed systems.

e-Prime - Advances in Electrical Engineering Electronics and EnergyVol. 10
Savitribai Phule Pune University (IN)
Reduced inequalities
Openalex Percentile: Top 82%
Distributed systems and fault tolerance
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.