FlexiShard: a Flexible Sharding Scheme for Blockchain based on a Hybrid Fault Model

Tirathraj Ramburn, D. Goswami
{"title":"FlexiShard: a Flexible Sharding Scheme for Blockchain based on a Hybrid Fault Model","authors":"Tirathraj Ramburn, D. Goswami","doi":"10.1109/ISPDC55340.2022.00011","DOIUrl":null,"url":null,"abstract":"One of the major bottlenecks of traditional Blockchain is its low throughput resulting in poor scalability. One way to increase throughput is to shard the network nodes to form smaller groups (shards). There are a number of sharding schemes in the literature with a common goal: nodes are split into groups to concurrently process different sets of transactions. Parallelism is used to enhance scalability, however with a trade-off in fault-tolerance; i.e., the smaller the shard size is, the better is the performance but higher is the fault probability. Contemporary sharding schemes use variants of Byzantine Fault Tolerance (BFT) protocol as their intra-shard consensus algorithms. BFT gives good performance when shard sizes are kept relatively small and maximum allowable faults is below some threshold. However, all these systems make rigid assumptions about their shard sizes and maximum allowable faults which may not be practical at times. In recent years, there have been more practical hybrid fault models in the literature which are better applicable to Blockchain (e.g., hybrid of Byzantine and alive-but-corrupt (abc) faults where the latter only compromises on safety) and corresponding consensus protocols that offer flexibility in choice of fault types and quorum sizes, e.g., Flexible Byzantine Fault Tolerance (Flexible BFT). In this paper, we present a new sharding scheme, FlexiShard, that uses Flexible BFT as its intra-shard consensus algorithm. FlexiShard leverages the notion of flexible Byzantine quorums and the hybrid fault model introduced in Flexible BFT that comprises of Byzantine and abc faults. Use of Flexible BFT allows flexibility in the choice of fault types and choosing shard sizes based on a range of allowable fault thresholds. Additionally, it allows to form shards that can tolerate more total faults than traditional BFT shards of similar size, and hence can deliver similar performance but with more fault-tolerance. To the best of our knowledge, FlexiShard is the first application of Flexible BFT and the hybrid fault model to Blockchain and its sharding. A theoretical analysis of FlexiShard is presented which demonstrates its flexibility and advantages over traditional sharding schemes.","PeriodicalId":389334,"journal":{"name":"2022 21st International Symposium on Parallel and Distributed Computing (ISPDC)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 21st International Symposium on Parallel and Distributed Computing (ISPDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPDC55340.2022.00011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

One of the major bottlenecks of traditional Blockchain is its low throughput resulting in poor scalability. One way to increase throughput is to shard the network nodes to form smaller groups (shards). There are a number of sharding schemes in the literature with a common goal: nodes are split into groups to concurrently process different sets of transactions. Parallelism is used to enhance scalability, however with a trade-off in fault-tolerance; i.e., the smaller the shard size is, the better is the performance but higher is the fault probability. Contemporary sharding schemes use variants of Byzantine Fault Tolerance (BFT) protocol as their intra-shard consensus algorithms. BFT gives good performance when shard sizes are kept relatively small and maximum allowable faults is below some threshold. However, all these systems make rigid assumptions about their shard sizes and maximum allowable faults which may not be practical at times. In recent years, there have been more practical hybrid fault models in the literature which are better applicable to Blockchain (e.g., hybrid of Byzantine and alive-but-corrupt (abc) faults where the latter only compromises on safety) and corresponding consensus protocols that offer flexibility in choice of fault types and quorum sizes, e.g., Flexible Byzantine Fault Tolerance (Flexible BFT). In this paper, we present a new sharding scheme, FlexiShard, that uses Flexible BFT as its intra-shard consensus algorithm. FlexiShard leverages the notion of flexible Byzantine quorums and the hybrid fault model introduced in Flexible BFT that comprises of Byzantine and abc faults. Use of Flexible BFT allows flexibility in the choice of fault types and choosing shard sizes based on a range of allowable fault thresholds. Additionally, it allows to form shards that can tolerate more total faults than traditional BFT shards of similar size, and hence can deliver similar performance but with more fault-tolerance. To the best of our knowledge, FlexiShard is the first application of Flexible BFT and the hybrid fault model to Blockchain and its sharding. A theoretical analysis of FlexiShard is presented which demonstrates its flexibility and advantages over traditional sharding schemes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
FlexiShard:一种基于混合故障模型的区块链灵活分片方案
传统区块链的主要瓶颈之一是吞吐量低,导致可伸缩性差。提高吞吐量的一种方法是对网络节点进行分片,形成更小的组(分片)。文献中有许多分片方案,它们都有一个共同的目标:将节点分成组,以并发地处理不同的事务集。并行性用于增强可伸缩性,但是要在容错性方面进行权衡;即分片大小越小,性能越好,但故障概率越高。当代分片方案使用拜占庭容错(BFT)协议的变体作为分片内共识算法。当分片大小保持相对较小且最大允许错误低于某个阈值时,BFT提供了良好的性能。然而,所有这些系统都对它们的分片大小和最大允许错误做出了严格的假设,这有时可能不实用。近年来,文献中出现了更实用的混合故障模型,这些模型更适用于b区块链(例如,拜占庭和活但损坏(abc)故障的混合,后者仅损害安全性)和相应的共识协议,这些协议在故障类型和仲裁规模的选择上提供了灵活性,例如柔性拜占庭容错(Flexible Byzantine fault Tolerance,简称Flexible BFT)。在本文中,我们提出了一种新的分片方案FlexiShard,它使用Flexible BFT作为其分片内一致性算法。FlexiShard利用了灵活Byzantine quorum的概念和flexible BFT中引入的混合故障模型,该模型由Byzantine和abc故障组成。使用灵活的BFT可以灵活地选择故障类型,并根据可允许的故障阈值范围选择分片大小。此外,它允许形成的分片比相同大小的传统BFT分片能够容忍更多的总错误,因此可以提供类似的性能,但具有更高的容错性。据我们所知,FlexiShard是首次将Flexible BFT和混合故障模型应用于区块链及其分片。对FlexiShard进行了理论分析,证明了其灵活性和优于传统分片方案的优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Estimating the Impact of Communication Schemes for Distributed Graph Processing Sponsors and Conference Support Performance Comparison of Speculative Taskloop and OpenMP-for-Loop Thread-Level Speculation on Hardware Transactional Memory [Full] Deep Heuristic for Broadcasting in Arbitrary Networks Analysis and Mitigation of Soft-Errors on High Performance Embedded GPUs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1