Performance Modeling of Hyperledger Fabric (Permissioned Blockchain Network)

H. Sukhwani, Nan Wang, Kishor S. Trivedi, A. Rindos
{"title":"Performance Modeling of Hyperledger Fabric (Permissioned Blockchain Network)","authors":"H. Sukhwani, Nan Wang, Kishor S. Trivedi, A. Rindos","doi":"10.1109/NCA.2018.8548070","DOIUrl":null,"url":null,"abstract":"Hyperledger Fabric (HLF) is an open-source implementation of a distributed ledger platform for running smart contracts in a modular architecture. In this paper, we present a performance model of Hyperledger Fabric v1.0+ using Stochastic Reward Nets (SRN). From our detailed model, we can compute the throughput, utilization and mean queue length at each peer and critical processing stages within a peer. To validate our model, we setup an HLF network in our lab and run workload using Hyperledger Caliper. From our analysis results, we find that time to complete the endorsement process is significantly affected by the number of peers and policies such as AND (). The performance bottleneck of the ordering service and ledger write can be mitigated using a larger block size, albeit with an increase in latency. For the committing peer, the transaction validation check (using Validation System Chaincode (VSCC)) is a time-consuming step, but its performance impact can be easily mitigated since it can be parallelized. However, its performance is critical, since it absorbs the shock of bursty block arrivals. We also analyze various what-if scenarios, such as peers processing transactions in a pipeline, and multiple endorsers per organization.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"123","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCA.2018.8548070","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 123

Abstract

Hyperledger Fabric (HLF) is an open-source implementation of a distributed ledger platform for running smart contracts in a modular architecture. In this paper, we present a performance model of Hyperledger Fabric v1.0+ using Stochastic Reward Nets (SRN). From our detailed model, we can compute the throughput, utilization and mean queue length at each peer and critical processing stages within a peer. To validate our model, we setup an HLF network in our lab and run workload using Hyperledger Caliper. From our analysis results, we find that time to complete the endorsement process is significantly affected by the number of peers and policies such as AND (). The performance bottleneck of the ordering service and ledger write can be mitigated using a larger block size, albeit with an increase in latency. For the committing peer, the transaction validation check (using Validation System Chaincode (VSCC)) is a time-consuming step, but its performance impact can be easily mitigated since it can be parallelized. However, its performance is critical, since it absorbs the shock of bursty block arrivals. We also analyze various what-if scenarios, such as peers processing transactions in a pipeline, and multiple endorsers per organization.
Hyperledger Fabric (Permissioned Blockchain Network)性能建模
Hyperledger Fabric (HLF)是一个分布式账本平台的开源实现,用于在模块化架构中运行智能合约。在本文中,我们提出了一个使用随机奖励网(SRN)的Hyperledger Fabric v1.0+的性能模型。从我们的详细模型中,我们可以计算每个节点上的吞吐量、利用率和平均队列长度,以及节点内的关键处理阶段。为了验证我们的模型,我们在实验室中设置了一个HLF网络,并使用Hyperledger Caliper运行工作负载。从我们的分析结果中,我们发现完成背书过程的时间受到同伴数量和策略(如and())的显著影响。排序服务和账本写的性能瓶颈可以使用更大的块大小来缓解,尽管延迟会增加。对于提交对等体,事务验证检查(使用验证系统链码(VSCC))是一个耗时的步骤,但它的性能影响可以很容易地减轻,因为它可以并行化。然而,它的性能是至关重要的,因为它吸收了爆炸块到达时的冲击。我们还分析了各种假设场景,例如在管道中处理事务的对等节点,以及每个组织有多个背书者。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信