scholarly journals Improve PBFT Based on Hash Ring

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Wang Zhong ◽  
Xiandong Zheng ◽  
Wenlong Feng ◽  
Mengxing Huang ◽  
Siling Feng
Keyword(s):  
Fault Tolerance ◽  
Sharp Increase ◽  
Communication Complexity ◽  
Random Selection ◽  
Byzantine Fault Tolerance ◽  
Consensus Process ◽  
Frequent Switching ◽  
Proper Operation ◽  
Determination Mechanism ◽  
Selection Of

Aiming at the problems of practical Byzantine fault tolerance (PBFT) algorithm, such as high communication complexity, frequent switching views because of Byzantine node become primary nodes and random selection of primary node, HR-PBFT algorithm is proposed. First, the HR-PBFT algorithm uses a hash ring to group nodes, which ensures the randomness and fairness of the grouping. Then, a dual-view mechanism is used in the consensus process, where the first layer node maintains the primary view and the second layer node maintains the secondary view to ensure the proper operation of the algorithm. Finally, the Byzantine node determination mechanism is introduced to evaluate the node status according to the node behavior in the consensus process, improve the reliability of primary node selection, and reduce the frequency of view changes. The experimental results show that the optimized HR-PBFT algorithm can effectively improve the problem of the sharp increase in the number of communications caused by the increase in the number of nodes in the network and prevent frequent view changes.

scholarly journals Improved PBFT Algorithm For High-Frequency Trading Scenarios of Alliance Blockchain

2022 ◽  
Author(s):  
Song Tang ◽  
Zhiqiang Wang ◽  
Jian Jiang ◽  
Suli Ge ◽  
GaiFang Tan
Keyword(s):  
High Frequency ◽  
Communication Overhead ◽  
Byzantine Fault Tolerance ◽  
Consensus Process ◽  
Network Nodes ◽  
Consensus Algorithms ◽  
Blockchain Technology ◽  
Information Interaction ◽  
Simple Selection ◽  
Selection Of

Abstract With the continuous development of blockchain technology and the emergence of application scenarios, consensus algorithms are still the bottleneck restricting the number of network nodes and data writing efficiency that blockchain can support. How to improve the performance of alliance blockchains safely and efficiently has become an urgent problem to be solved at present. For the practical Byzantine fault tolerance algorithm (PBFT) commonly used in alliance blockchains, there are some problems, such as large communication overhead, simple selection of master nodes, and inability to expand and exit nodes dynamically in the network. This paper proposes an improved algorithm tPBFT (trust-based practical Byzantine algorithm), which is suitable for the high-frequency transaction scenario of alliance chains and introduces a trust interest scoring mechanism between network nodes to adjust the list of consensus nodes dynamically, simplify the PBFT consensus process and reduce the interaction overhead between network nodes. Theoretical analysis and experiments show that the improved tPBFT algorithm can effectively reduce the amount of information interaction between nodes, improve consensus efficiency and support more network nodes.

scholarly journals A Coordination Technique for Improving Scalability of Byzantine Fault-Tolerant Consensus

2020 ◽  
Vol 10 (21) ◽  
pp. 7609
Author(s):  
Jungwon Seo ◽  
Deokyoon Ko ◽  
Suntae Kim ◽  
Sooyong Park
Keyword(s):  
Fault Tolerance ◽  
Performance Improvement ◽  
Fault Tolerant ◽  
The Other ◽  
Consensus Algorithm ◽  
Byzantine Fault Tolerance ◽  
Consensus Process ◽  
Consensus Algorithms ◽  
Byzantine Fault ◽  
Research Questions

Among various consensus algorithms, the Byzantine Fault Tolerance (BFT)-based consensus algorithms are broadly used for private blockchain. However, as BFT-based consensus algorithms are structured for all participants to take part in a consensus process, a scalability issue becomes more noticeable. In this approach, we introduce a consensus coordinator to execute a conditionally BFT-based consensus algorithm by classifying transactions. Transactions are divided into equal and unequal transactions. Moreover, unequal transactions are divided again and classified as common and trouble transactions. After that, a consensus algorithm is only executed for trouble transactions, and BFT-based consensus algorithms can achieve scalability. For evaluating our approach, we carried out three experiments in response to three research questions. By applying our approach to PBFT, we obtained 4.75 times better performance than using only PBFT. In the other experiment, we applied our approach to IBFT of Hyperledger Besu, and our result shows a 61.81% performance improvement. In all experiments depending on the change of the number of blockchain nodes, we obtained the better performance than original BFT-based consensus algorithms; thus, we can conclude that our approach improved the scalability of original BFT-based consensus algorithms. We also showed a correlation between performance and trouble transactions associated with transaction issue intervals and the number of blockchain nodes.

Tax Practitioner Credentials and the Incidence of IRS Audit Adjustments

2003 ◽  
Vol 17 (1) ◽  
pp. 1-14 ◽  
Author(s):  
Peggy A. Hite ◽  
John Hasseldine
Keyword(s):  
Random Selection ◽  
Internal Revenue Service ◽  
Internal Revenue ◽  
Tax Returns ◽  
Selection Of

This study analyzes a random selection of Internal Revenue Service (IRS) office audits from October 1997 to July 1998, the type of audit that concerns most taxpayers. Taxpayers engage paid preparers in order to avoid this type of audit and to avoid any resulting tax adjustments. The study examines whether there are more audit adjustments and penalty assessments on tax returns with paid-preparer assistance than on tax returns without paid-preparer assistance. By comparing the frequency of adjustments on IRS office audits, the study finds that there are significantly fewer tax adjustments on paid-preparer returns than on self-prepared returns. Moreover, CPA-prepared returns resulted in fewer audit adjustments than non CPA-prepared returns.

Concurrent Practical Byzantine Fault Tolerance for Integration of Blockchain and Supply Chain

2021 ◽  
Vol 21 (1) ◽  
pp. 1-17 ◽  
Author(s):  
Xiaolong Xu ◽  
Dawei Zhu ◽  
Xiaoxian Yang ◽  
Shuo Wang ◽  
Lianyong Qi ◽  
...  
Keyword(s):  
Supply Chain ◽  
Fault Tolerance ◽  
Byzantine Fault Tolerance ◽  
Byzantine Fault

EXPLOITING THE MEMORY HIERARCHY OF MULTICORE SYSTEMS FOR PARALLEL TRIANGULATION REFINEMENT

2012 ◽  
Vol 22 (03) ◽  
pp. 1250007 ◽  
Author(s):  
PEDRO RODRÍGUEZ ◽  
MARÍA CECILIA RIVARA ◽  
ISAAC D. SCHERSON
Keyword(s):  
Parallel Implementation ◽  
Memory Hierarchy ◽  
Random Selection ◽  
Multicore Systems ◽  
Algorithm Performance ◽  
Bisection Algorithm ◽  
Improve Algorithm ◽  
Triangulation Refinement ◽  
Selection Of

A novel parallelization of the Lepp-bisection algorithm for triangulation refinement on multicore systems is presented. Randomization and wise use of the memory hierarchy are shown to highly improve algorithm performance. Given a list of selected triangles to be refined, random selection of candidates together with pre-fetching of Lepp-submeshes lead to a scalable and efficient multi-core parallel implementation. The quality of the refinement is shown to be preserved.

Sign in / Sign up

Export Citation Format

Share Document