TL-PBFT: An Improved PBFT Consensus Algorithm Based on Tree-layered Communication Structure

• Liliang Lei,
• Guifeng Wu,
• Dengqi Yang,
• Benhui Chen,
• Xiaowei Li,

Vol. 19, No. 6, June 30, 2025
10.3837/tiis.2025.06.012, Download Paper (Free):

• tree-layered communication structure
• PBFT
• Consensus Algorithm
• sinking algorithm
• Blockchain Technology

Abstract

Aiming at the problems of high communication complexity, low throughput, and low security of traditional PBFT in large-scale node scenarios, this paper proposes an improved PBFT consensus algorithm based on a tree-like communication structure, TL-PBFT (Tree-layered Practical Byzantine Fault Tolerance). The TL-PBFT algorithm reduces the communication burden of each node by organizing the network nodes into a tree-like structure with hierarchical and local consensus mechanisms. TL-PBFT introduces tree-like communication paths during the pre-preparation, preparation, and commit phases, where each node only needs to communicate with its parent, child, and sibling nodes, significantly reducing the message passing volume. Meanwhile, a sinking algorithm is designed to address the problem of malicious nodes. The experimental results show that the communication complexity of TL-PBFT is close to O(N), and compared to the traditional PBFT consensus algorithm, it reduces message passing by approximately 50%, shortens consensus latency by about 30%, and improves system throughput by around 40% in large-scale node environments.

Statistics

Cite this article