Scalable Dynamic Multi-Agent Practical Byzantine Fault-Tolerant Consensus in Permissioned Blockchain
The permissioned blockchain system has recently become popular in a wide range of scenarios, such as artificial intelligence, financial applications and the Internet of things, due to its dominance in terms of distribution, decentralization, reliability and security. However, the Practical Byzantine...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-10-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | http://www.mdpi.com/2076-3417/8/10/1919 |
id |
doaj-7e2b888e2f6a4aadbc0381f946c5fb2f |
---|---|
record_format |
Article |
spelling |
doaj-7e2b888e2f6a4aadbc0381f946c5fb2f2020-11-24T23:08:34ZengMDPI AGApplied Sciences2076-34172018-10-01810191910.3390/app8101919app8101919Scalable Dynamic Multi-Agent Practical Byzantine Fault-Tolerant Consensus in Permissioned BlockchainLibo Feng0Hui Zhang1Yong Chen2Liqi Lou3State Key Laboratory of Software Development Environment, Beihang University, Beijing 100191, ChinaState Key Laboratory of Software Development Environment, Beihang University, Beijing 100191, ChinaState Key Laboratory of Software Development Environment, Beihang University, Beijing 100191, ChinaState Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing 100876, ChinaThe permissioned blockchain system has recently become popular in a wide range of scenarios, such as artificial intelligence, financial applications and the Internet of things, due to its dominance in terms of distribution, decentralization, reliability and security. However, the Practical Byzantine Fault-Tolerant (PBFT) algorithm, which is currently adopted in such systems, sparks communication bottlenecks when the number of consensus nodes increases sharply, which seriously hinders large-scale applications. In this paper, we propose a scalable dynamic multi-agent hierarchical PBFT algorithm (SDMA-PBFT), which reduces the communication costs from O(n2) to O( n × k × log k n ). Specifically, SDMA-PBFT forms multiple autonomous systems at each agent node in which message multicasting can be efficiently carried out and the internal voting results can be effectively collected. Therefore, the design of these agent nodes facilitates the in-and-out operations of consensus nodes in the blockchain system. Simulation results show that our proposed algorithm substantially outperforms the PBFT algorithm in terms of latency. Hence, it can be applied to the permissioned blockchain system effectively and efficiently.http://www.mdpi.com/2076-3417/8/10/1919permissioned blockchainbyzantine fault tolerancemulti-agentconsensusdistributed systemsstate machine replication |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Libo Feng Hui Zhang Yong Chen Liqi Lou |
spellingShingle |
Libo Feng Hui Zhang Yong Chen Liqi Lou Scalable Dynamic Multi-Agent Practical Byzantine Fault-Tolerant Consensus in Permissioned Blockchain Applied Sciences permissioned blockchain byzantine fault tolerance multi-agent consensus distributed systems state machine replication |
author_facet |
Libo Feng Hui Zhang Yong Chen Liqi Lou |
author_sort |
Libo Feng |
title |
Scalable Dynamic Multi-Agent Practical Byzantine Fault-Tolerant Consensus in Permissioned Blockchain |
title_short |
Scalable Dynamic Multi-Agent Practical Byzantine Fault-Tolerant Consensus in Permissioned Blockchain |
title_full |
Scalable Dynamic Multi-Agent Practical Byzantine Fault-Tolerant Consensus in Permissioned Blockchain |
title_fullStr |
Scalable Dynamic Multi-Agent Practical Byzantine Fault-Tolerant Consensus in Permissioned Blockchain |
title_full_unstemmed |
Scalable Dynamic Multi-Agent Practical Byzantine Fault-Tolerant Consensus in Permissioned Blockchain |
title_sort |
scalable dynamic multi-agent practical byzantine fault-tolerant consensus in permissioned blockchain |
publisher |
MDPI AG |
series |
Applied Sciences |
issn |
2076-3417 |
publishDate |
2018-10-01 |
description |
The permissioned blockchain system has recently become popular in a wide range of scenarios, such as artificial intelligence, financial applications and the Internet of things, due to its dominance in terms of distribution, decentralization, reliability and security. However, the Practical Byzantine Fault-Tolerant (PBFT) algorithm, which is currently adopted in such systems, sparks communication bottlenecks when the number of consensus nodes increases sharply, which seriously hinders large-scale applications. In this paper, we propose a scalable dynamic multi-agent hierarchical PBFT algorithm (SDMA-PBFT), which reduces the communication costs from O(n2) to O( n × k × log k n ). Specifically, SDMA-PBFT forms multiple autonomous systems at each agent node in which message multicasting can be efficiently carried out and the internal voting results can be effectively collected. Therefore, the design of these agent nodes facilitates the in-and-out operations of consensus nodes in the blockchain system. Simulation results show that our proposed algorithm substantially outperforms the PBFT algorithm in terms of latency. Hence, it can be applied to the permissioned blockchain system effectively and efficiently. |
topic |
permissioned blockchain byzantine fault tolerance multi-agent consensus distributed systems state machine replication |
url |
http://www.mdpi.com/2076-3417/8/10/1919 |
work_keys_str_mv |
AT libofeng scalabledynamicmultiagentpracticalbyzantinefaulttolerantconsensusinpermissionedblockchain AT huizhang scalabledynamicmultiagentpracticalbyzantinefaulttolerantconsensusinpermissionedblockchain AT yongchen scalabledynamicmultiagentpracticalbyzantinefaulttolerantconsensusinpermissionedblockchain AT liqilou scalabledynamicmultiagentpracticalbyzantinefaulttolerantconsensusinpermissionedblockchain |
_version_ |
1725613588802961408 |