Improve pbft based on hash ring
Witryna22 lut 2024 · Abstract: Nowadays Practical Byzantine Fault Tolerance (PBFT) algorithm has become the most extensive consensus algorithm in the alliance chain. However, the PBFT algorithm is usually only applicable to small networks due to high communication complexity and poor scalability. Witryna6 sty 2024 · Optimized PBFT algorithm based on improved C4.5 mainly includes optimization of PBFT algorithm and leader node selection strategy based on an integral voting system. The optimization of PBFT algorithm mainly reduces communication times and improves consensus efficiency by grouping consensus nodes after being …
Improve pbft based on hash ring
Did you know?
Witryna1 mar 2024 · By simplifying the PBFT consensus protocol, the time complexity of the protocol is reduced from O (n 2) to O (n). It effectively improves the consensus efficiency, throughput and block generation speed. Xiang, Huaimin and Peichang (2024)proposed proof of previous transactions (PoPT). Witryna15 mar 2024 · PDF Recent advancement in IoT technology has boosted the healthcare domain with enormous usage of IoT devices to provide elevated services to patients... Find, read and cite all the research ...
WitrynaThe experimental results show that the optimized HR-PBFT algorithm can effectively improve the problem of the sharp increase in the number of communications caused … WitrynaSearch within Wenlong Feng's work. Search Search. Home Wenlong Feng Publications
Witryna23 lis 2024 · In the existing research, there are three types of improvement directions for the high-communication complexity problem of the PBFT consensus algorithm: (1) … WitrynaIn [10], it proposes an optimized PBFT based on feature trust model to improve Byzantine fault tolerance. ... Improve PBFT Based on Hash Ring Full-text available
Witryna28 paź 2024 · Therefore, a new improved PBFT consensus algorithm based on vague sets was proposed. The overall algorithm flowchart is shown in Supplementary Figure …
Witryna1 kwi 2024 · Improve PBFT Based on Hash Ring. ... 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 ... earth in no man\u0027s skyWitryna2 mar 2024 · PDF Aiming at the problems of PBFT algorithm of consortium blockchain, such as high communication overhead, low consensus efficiency, and random … earth innovationWitryna12 kwi 2024 · In this article, we provide a blockchain-based solution and framework for distributing and trading of electronic ticket. Sale and distribution of electronic ticket are governed by smart contracts built on the Ethereum public blockchain. E-ticket downloads/views occur on-chain and off-chain according to the ticket size. earthinnovation.orgWitryna8 maj 2024 · In this paper, we propose a practical Byzantine-fault-tolerance (PBFT)-based consensus algorithm called proof of previous transactions (PoPT), in which the accountants are selected by a specific hash function from a … c thomas trinder obitWitrynaDownload scientific diagram Recovery block technique algorithm from publication: Improving Performance of Software Fault Tolerant Techniques Using Multi-Core … c thomas mdWitryna10 kwi 2024 · PDF Consensus mechanisms play a critical role in blockchain networks, ensuring that all participants agree on the state of the distributed ledger.... Find, read and cite all the research you ... c thomas richardsonWitrynaAiming at the problems of practical Byzantine fault tolerance (PBFT) algorithm, such as high communication complexity, frequent switching views because of Byzantine node … c thomas kids