检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Haoxiang Luo
出 处:《Blockchain(Research and Applications)》2023年第4期50-62,共13页区块链研究(英文)
基 金:the Natural Science Foundation of Sichuan Province under Grant 2022NSFSC0913;and in part by the PCL Future Greater-Bay Area Network Facilities for Large-scale Experiments and Applications under Grant PCL2018KP001.
摘 要:Since the Practical Byzantine Fault Tolerance(PBFT)consensus mechanism can avoid the performance bottleneck of blockchain systems caused by Proof of Work(PoW),it has been widely used in many scenarios.However,in the blockchain system,each node is required to back up all transactions and block data of the system,which will waste a lot of storage resources.It is difficult to apply to scenarios with limited storage resources such as unmanned aerial vehicle networks and smart security protection;thus,it is often used in small-scale networks.In order to deploy PBFT-based blockchain systems in large-scale network scenarios,we propose an ultra-low storage overhead PBFT consensus(ULS-PBFT),which groups nodes hierarchically to limit the storage overhead within the group.In this paper,we first propose an optimal double-layer PBFT consensus from the perspective of minimizing the storage overhead,and prove that this consensus can significantly reduce the storage overhead.In addition,we also investigate the superiority of ULS-PBFT in terms of communication overhead while setting the security threshold in the presence of the possibility of Byzantine nodes.The simulation results demonstrate the advantages of ULS-PBFT.Then,we extend such grouping idea to the blockchain system with X-layer PBFT and analyze its storage and communication overhead.Finally,the node grouping strategy of double-layer PBFT is studied for four application scenarios when the performance of storage overhead,communication overhead,and security are considered comprehensively.
关 键 词:Blockchain Consensus mechanism PBFT Storage overhead Hierarchical grouping
分 类 号:TP311.13[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.16.90.150