A Scalable Byzantine Fault Tolerance Algorithm Based on a Tree Topology Network
The consortium chain is the main form of application of blockchain technology in the actual industry, and its consensus mechanism mostly adopts the practical Byzantine fault tolerance (PBFT) algorithm. The traditional PBFT algorithm is only suitable for small-scale local area networks, but in large-...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2023-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10091103/ |
| _version_ | 1797849294916550656 |
|---|---|
| author | Wangxi Jiang Xiaoxiong Wu Mingyang Song Jiwei Qin Zhenhong Jia |
| author_facet | Wangxi Jiang Xiaoxiong Wu Mingyang Song Jiwei Qin Zhenhong Jia |
| author_sort | Wangxi Jiang |
| collection | DOAJ |
| description | The consortium chain is the main form of application of blockchain technology in the actual industry, and its consensus mechanism mostly adopts the practical Byzantine fault tolerance (PBFT) algorithm. The traditional PBFT algorithm is only suitable for small-scale local area networks, but in large-scale wide area network environments, its scalability bottleneck has a serious impact on the performance of the system. Therefore, in this paper, a scalable Byzantine fault tolerance algorithm based on a tree topology network is proposed (STBFT), which can take different steps to reach consensus according to the abnormal situation of the system. First, the STBFT algorithm divides the consensus nodes into different layers and groups based on the tree topology network structure, which transforms from global consensus to local consensus and drastically reduces communication consumption. Then, the division method of the group is based on a verifiable random function (VRF), with the purpose of preventing targeted attacks and colluding Byzantine nodes from affecting the normal consensus of the system. Finally, a feedback mechanism is proposed for the first time to reduce the influence of Byzantine failure on hierarchical network systems. The simulation results show that the proposed algorithm reduces the communication complexity and improves the fault tolerance of the system, and the scalability of the tree topology network structure can be better applied in large-scale scenarios such as IoT and health care. |
| first_indexed | 2024-04-09T18:42:40Z |
| format | Article |
| id | doaj.art-3d75d6a7a47c424485ff5ddc2dee390b |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-04-09T18:42:40Z |
| publishDate | 2023-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-3d75d6a7a47c424485ff5ddc2dee390b2023-04-10T23:00:59ZengIEEEIEEE Access2169-35362023-01-0111335093351910.1109/ACCESS.2023.326401110091103A Scalable Byzantine Fault Tolerance Algorithm Based on a Tree Topology NetworkWangxi Jiang0https://orcid.org/0000-0002-2283-7093Xiaoxiong Wu1Mingyang Song2Jiwei Qin3Zhenhong Jia4https://orcid.org/0000-0002-5182-4929College of Information Science and Engineering, Xinjiang University, Ürümqi, ChinaCollege of Information Science and Engineering, Xinjiang University, Ürümqi, ChinaCollege of Information Science and Engineering, Xinjiang University, Ürümqi, ChinaCollege of Information Science and Engineering, Xinjiang University, Ürümqi, ChinaCollege of Information Science and Engineering, Xinjiang University, Ürümqi, ChinaThe consortium chain is the main form of application of blockchain technology in the actual industry, and its consensus mechanism mostly adopts the practical Byzantine fault tolerance (PBFT) algorithm. The traditional PBFT algorithm is only suitable for small-scale local area networks, but in large-scale wide area network environments, its scalability bottleneck has a serious impact on the performance of the system. Therefore, in this paper, a scalable Byzantine fault tolerance algorithm based on a tree topology network is proposed (STBFT), which can take different steps to reach consensus according to the abnormal situation of the system. First, the STBFT algorithm divides the consensus nodes into different layers and groups based on the tree topology network structure, which transforms from global consensus to local consensus and drastically reduces communication consumption. Then, the division method of the group is based on a verifiable random function (VRF), with the purpose of preventing targeted attacks and colluding Byzantine nodes from affecting the normal consensus of the system. Finally, a feedback mechanism is proposed for the first time to reduce the influence of Byzantine failure on hierarchical network systems. The simulation results show that the proposed algorithm reduces the communication complexity and improves the fault tolerance of the system, and the scalability of the tree topology network structure can be better applied in large-scale scenarios such as IoT and health care.https://ieeexplore.ieee.org/document/10091103/Tree topology networkPBFTscalabilitycommunication complexityhigh fault tolerance |
| spellingShingle | Wangxi Jiang Xiaoxiong Wu Mingyang Song Jiwei Qin Zhenhong Jia A Scalable Byzantine Fault Tolerance Algorithm Based on a Tree Topology Network IEEE Access Tree topology network PBFT scalability communication complexity high fault tolerance |
| title | A Scalable Byzantine Fault Tolerance Algorithm Based on a Tree Topology Network |
| title_full | A Scalable Byzantine Fault Tolerance Algorithm Based on a Tree Topology Network |
| title_fullStr | A Scalable Byzantine Fault Tolerance Algorithm Based on a Tree Topology Network |
| title_full_unstemmed | A Scalable Byzantine Fault Tolerance Algorithm Based on a Tree Topology Network |
| title_short | A Scalable Byzantine Fault Tolerance Algorithm Based on a Tree Topology Network |
| title_sort | scalable byzantine fault tolerance algorithm based on a tree topology network |
| topic | Tree topology network PBFT scalability communication complexity high fault tolerance |
| url | https://ieeexplore.ieee.org/document/10091103/ |
| work_keys_str_mv | AT wangxijiang ascalablebyzantinefaulttolerancealgorithmbasedonatreetopologynetwork AT xiaoxiongwu ascalablebyzantinefaulttolerancealgorithmbasedonatreetopologynetwork AT mingyangsong ascalablebyzantinefaulttolerancealgorithmbasedonatreetopologynetwork AT jiweiqin ascalablebyzantinefaulttolerancealgorithmbasedonatreetopologynetwork AT zhenhongjia ascalablebyzantinefaulttolerancealgorithmbasedonatreetopologynetwork AT wangxijiang scalablebyzantinefaulttolerancealgorithmbasedonatreetopologynetwork AT xiaoxiongwu scalablebyzantinefaulttolerancealgorithmbasedonatreetopologynetwork AT mingyangsong scalablebyzantinefaulttolerancealgorithmbasedonatreetopologynetwork AT jiweiqin scalablebyzantinefaulttolerancealgorithmbasedonatreetopologynetwork AT zhenhongjia scalablebyzantinefaulttolerancealgorithmbasedonatreetopologynetwork |