Improvement of PBFT Algorithm Based on CART

Liu, Jian; Feng, Wenlong; He, Feiyang

doi:10.3390/electronics12061460

Cited by 5 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, only four (figure 3) popular consensus algorithms are explained which will support designing a new approach of classical PBFT for a consensus system of IoT devices. (a) PBFT [13] (b) C-PBFT [28] Request Proposal Commit Reply (c) CRBFT [29] (d) GPBFT [30] Figure 3 Well-known PBFT algorithms…”

Section: Pbft and Its' Variationmentioning

confidence: 99%

See 1 more Smart Citation

Boolean Byzantine Fault Tolerant Algorithm for Light Weight IoT Consensus

Sarker

2024

Preprint

View full text Add to dashboard Cite

Nowadays consensus algorithms are the backbone of fault tolerant systems, communication protocols, and distributed blockchain services though it is initiated to ensure reliable service in the presence of Byzantine faults of a distributed infrastructure. Real time automation system is highly depended on the reliability of IoT devices which are lightweight resource constrained components that demands a computationally faster algorithm within minimum number of steps. This research proposed a Boolean Byzantine Fault Tolerant (BBFT) algorithm that completes a consensus process by 3 steps only. It makes consensus by bitwise logical operations where all nodes get same decision after steps 3. It is proposed for static and predefined nodes of an agreement system that can detect malicious and anomaly nodes at the earlier stage than existing Byzantine Fault Tolerant (BFT) algorithms. BBFT is designed for resource constrained (limited memory and processing power) IoT devices where limited number of similar nodes can make an agreement. Boolean operations of the algorithm make it simple, easier for mathematical modeling, and suitable to express by vector notations of quantum computing applications. Though time complexity (O(n) = n2) of the BBFT is same as other classical BFT algorithms, it saves resources and reduces information processing delay due to the implementation of Boolean operations.

show abstract

Section: Pbft and Its' Variationmentioning

confidence: 99%

“…On the road of improvement, Liu J et al proposed an optimization form of PBFT called C-PBFT (figure 3b) that enhances scalability and optimizes master node selection of the consensus process [28]. It resolves random master node selection and increases consensus efficiency by voting mechanism and groupconsensus technique respectively.…”

Section: C-pbftmentioning

confidence: 99%

Boolean Byzantine Fault Tolerant Algorithm for Light Weight IoT Consensus

Sarker

2024

Preprint

View full text Add to dashboard Cite

show abstract

“…Liu [19] et al utilized the integral grouping mechanism to select nodes with high trust to form a consensus group, use the consensus group instead of all the nodes to carry out consensus, and assign the voting value to the nodes of the consensus group to reduce the amount of communication in the consensus process. This solution addressed the issue of random selection of master nodes and poor expandability.…”

Section: Related Workmentioning

confidence: 99%

Grouped Multilayer Practical Byzantine Fault Tolerance Algorithm: A Practical Byzantine Fault Tolerance Consensus Algorithm Optimized for Digital Asset Trading Scenarios

Liu,

Feng,

Huang

et al. 2023

Sensors

Self Cite

View full text Add to dashboard Cite

Based on the practical Byzantine fault tolerance algorithm (PBFT), a grouped multilayer PBFT consensus algorithm (GM-PBFT) is proposed to be applied to digital asset transactions in view of the problems with excessive communication complexity and low consensus efficiency found in the current consensus mechanism for digital asset transactions. Firstly, the transaction nodes are grouped by type, and each group can handle different types of consensus requests at the same time, which improves the consensus efficiency as well as the accuracy of digital asset transactions. Second, the group develops techniques like validation, auditing, and re-election to enhance Byzantine fault tolerance by thwarting malicious node attacks. This supervisory mechanism is implemented through the Raft consensus algorithm. Finally, the consensus is stratified for the nodes in the group, and the consensus nodes in the upper layer recursively send consensus requests to the lower layer until the consensus request reaches the end layer to ensure the consistency of the block ledger in the group. Based on the results of the experiment, the approach may significantly outperform the PBFT consensus algorithm when it comes to accuracy, efficiency, and preserving the security and reliability of transactions in large-scale network node digital transaction situations.

show abstract

“…The optimised version of the CART algorithm [8,9] implemented in scikit-learn was used. This technique has been applied to different fields such as risk management and green building, e.g., [10,11].…”

mentioning

confidence: 99%

Multidimensional Data Analysis for Enhancing In-Depth Knowledge on the Characteristics of Science and Technology Parks

Francés,

Abreu-Salas,

Fernández

et al. 2023

Applied Sciences

View full text Add to dashboard Cite

The role played by science and technology parks (STPs) in technology transfer, industrial innovation, and economic growth is examined in this paper. The accurate monitoring of their evolution and impact is hindered by the lack of uniformity in STP models or goals, and the scarcity of high-quality datasets. This work uses existing terminologies, definitions, and core features of STPs to conduct a multidimensional data analysis that explores and evaluates the 21 core features which describe the key internal factors of an STP. The core features are gathered from a reliable and updatable dataset of Spanish STPs. The methodological framework can be replicated for other STP contexts and is based on descriptive techniques and machine-learning tools. The results of the study provide an overview of the general situation of STPs in Spain, validate the existence and characteristics of three types of STPs, and identify the typical features of STPs. Moreover, the prototype STP can be used as a benchmark so that other STPs can identify the features that need to be improved. Finally, this work makes it possible to carry out classifications of STPs, in addition to prediction and decision making for innovation ecosystems.

show abstract

Improvement of PBFT Algorithm Based on CART

Cited by 5 publications

References 7 publications

Boolean Byzantine Fault Tolerant Algorithm for Light Weight IoT Consensus

Boolean Byzantine Fault Tolerant Algorithm for Light Weight IoT Consensus

Grouped Multilayer Practical Byzantine Fault Tolerance Algorithm: A Practical Byzantine Fault Tolerance Consensus Algorithm Optimized for Digital Asset Trading Scenarios

Multidimensional Data Analysis for Enhancing In-Depth Knowledge on the Characteristics of Science and Technology Parks

Contact Info

Product

Resources

About