【Author】
Tang, Song; Wang, Zhiqiang; Jiang, Jian; Ge, Suli; Tan, GaiFang
【Source】SCIENTIFIC REPORTS
【Abstract】With the continuous development of blockchain technology, the application scenarios of alliance blockchain are also increasing. The consensus algorithm can achieve distributed consensus among nodes in the network. At present, the practical byzantine fault tolerance algorithm (PBFT) consensus algorithm commonly used in alliance blockchain requires all nodes in the network to participate in the consensus process. Experiments show that when the number of consensus nodes in the system exceeds 100, the bandwidth consumption and consensus delay will greatly increase, resulting in the inability of PBFT to be applied. In scenes with many nodes. How to improve the performance of alliance blockchains safely and efficiently has become an urgent problem to be solved at present. For the 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 high-frequency trading scenarios of consortium chains. By introducing a trust equity scoring mechanism between nodes in the network, the list of consensus nodes can be dynamically adjusted. tPBFT simplifies the pre-prepare stage of the PBFT consensus process, and realizes the verification of the hash transaction list in the reply stage, thereby reducing the interaction overhead between network nodes. Theoretical analysis and experiments show that when the number of nodes in the network is greater than 30, with the further increase of the number of nodes, the improved tPBFT algorithm has a relatively large performance in terms of node communication overhead, consensus efficiency and scalability outperforms the PBFT algorithm.
【摘要】随着区块链技术的不断发展，联盟区块链的应用场景也越来越多。共识算法可以在网络中的节点之间实现分布式共识。目前，联盟区块链中常用的实用拜占庭容错算法（PBFT）共识算法要求网络中的所有节点都参与共识过程。实验表明，当系统中的共识节点数量超过 100 个时，带宽消耗和共识延迟会大大增加，导致 PBFT 无法应用。在具有许多节点的场景中。如何安全高效地提升联盟区块链的性能，成为当前亟待解决的问题。对于联盟区块链中常用的PBFT，存在通信开销大、主节点选择简单、无法在网络中动态扩展和退出节点等问题。本文提出了一种改进的算法tPBFT（基于信任的实用拜占庭算法），适用于联盟链的高频交易场景。通过引入网络节点间的信任公平评分机制，可以动态调整共识节点列表。 tPBFT 简化了 PBFT 共识过程的预准备阶段，在回复阶段实现了哈希交易列表的验证，从而减少了网络节点之间的交互开销。理论分析和实验表明，当网络中的节点数大于30时，随着节点数的进一步增加，改进的tPBFT算法在节点通信开销、共识效率和可扩展性方面都有较大的表现。 PBFT算法。
评论