Problems such as data security and trustworthy interactivity bring new challenges to the development and application of service ecosystems. As a decentralized ledger, blockchain has characteristics such as non-tamperability, unforgeability, traceability, global consistency, so that the integration between blockchain and service ecosystems can ensure data integrity and service availability. The purpose of this paper is to investigate problems of efficient consensus algorithm in service ecosystems alliance chain scenarios.
This method consists of two core modules: bubble sort and reputation mechanism. The bubble sort algorithm can reduce the number of consensus nodes, thereby reducing communication overhead and improving throughput. The reputation mechanism can improve the correctness of consensus nodes, thereby solving the problem of random selection of the primary in the PBFT algorithm and improving its security and efficiency.
Comparative experiments and analysis have been conducted between the practical Byzantine fault-tolerant algorithm combined with bubble sort and reputation mechanism (BR-PBFT) scheme proposed in this paper and existing similar PBFT algorithms in terms of communication complexity, transaction confirmation delay and throughput. The experimental results demonstrate that BR-PBFT maintains 1/3 fault tolerance of PBFT, effectively reduces communication overhead, lowers transaction confirmation delay and improves throughput.
The practical Byzantine fault tolerance (PBFT) algorithm used in the alliance chain still has the problems of high communication complexity and low throughput. Aiming at application scenarios of alliance chains in service ecosystems, an improved is proposed. It provides valuable insights into future research and practical applications in service ecosystems.
