2022
DOI: 10.1155/2022/1855238
|View full text |Cite|
|
Sign up to set email alerts
|

Fault Tolerance Byzantine Algorithm for Lower Overhead Blockchain

Abstract: A new algorithm for practical Byzantine fault tolerance (PBFT), called score-PBFT or S-PBFT, is proposed to solve the problems of high communication overhead and low algorithm efficiency. This algorithm is based on the characteristics of the consortium chain. The scoring mechanism for nodes is added. All the nodes are broken up into consensus nodes, candidate nodes, and early nodes. To make sure the consensus nodes are as reliable as possible, the nodes are changed dynamically based on how each node is behavin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…Yao Sou et al [30] proposed a more efficient consensus algorithm called SV-PBFT (Shapley Value-PBFT), which simplifies the consensus process, reduces communication overhead, and enhances consensus efficiency. In Riyad et al [31], to address the challenges of high communication overhead and low algorithm efficiency, a practical Byzantine fault tolerance algorithm (S-PBFT) was proposed, tailored to the characteristics of consortium blockchains. This algorithm introduces a node-scoring mechanism, classifying nodes into consensus nodes, candidate nodes, and early-stage nodes.…”
Section: Consensus Algorithmsmentioning
confidence: 99%
“…Yao Sou et al [30] proposed a more efficient consensus algorithm called SV-PBFT (Shapley Value-PBFT), which simplifies the consensus process, reduces communication overhead, and enhances consensus efficiency. In Riyad et al [31], to address the challenges of high communication overhead and low algorithm efficiency, a practical Byzantine fault tolerance algorithm (S-PBFT) was proposed, tailored to the characteristics of consortium blockchains. This algorithm introduces a node-scoring mechanism, classifying nodes into consensus nodes, candidate nodes, and early-stage nodes.…”
Section: Consensus Algorithmsmentioning
confidence: 99%
“…Almakki Riyad et al 25 proposed a practical Byzantine fault-tolerant algorithm S-PBFT to address the problems of high communication overhead and low efficiency of the traditional Byzantine fault-tolerant algorithm. The algorithm adds a node scoring mechanism, and all nodes are classified into consensus nodes, candidate nodes, and early nodes.…”
Section: Typesmentioning
confidence: 99%
“…Step 2 is data understanding and its objective is to know what can be expected and achieved from this data. All so checks the quality of the data, in several terms, such as data completeness, value distributions, and data governance compliance (Almakki et al, 2022). In these steps, data scientists in the data mining process are covered data mining models, Steps, and challenges involved in the data extraction process., how the current state of the use of full data is and how it should be, in order to be useful to the algorithm and process involved (Mariscal et al, 2010).…”
Section: Introductionmentioning
confidence: 99%