Estuary: A Low Cross-Shard Blockchain Sharding Protocol Based on State Splitting

计算机科学 架空(工程) 数据库事务 吞吐量 协议(科学) 国家(计算机科学) 计算机网络 操作系统 数据库 算法 无线 医学 替代医学 病理
作者
Linpeng Jia,Yanxiu Liu,Keyuan Wang,Yi Sun
出处
期刊:IEEE Transactions on Parallel and Distributed Systems [Institute of Electrical and Electronics Engineers]
卷期号:35 (3): 405-420 被引量:3
标识
DOI:10.1109/tpds.2024.3351632
摘要

Sharding is one of the most promising technologies for significantly increasing blockchain transaction throughput. However, as the number of shards increases, the ratio of cross-shard transactions in existing blockchain sharding protocols gradually approaches 100%. Since cross-shard transactions consume many times more resources than intra-shard transactions, the processing overhead of cross-shard transactions already accounts for the majority of the total overhead of the sharding system. There is a very large gap between the transaction throughput of the sharding system and its theoretical upper limit. In this paper, we propose Estuary, a novel low cross-shard blockchain sharding protocol. Taking the state model as an entry point, Estuary designs a multi-level state model and state splitting and aggregation mechanism. It decouples the identity and quantity of state units, enabling transactions between users to be completed within one shard. Only when the state quantity for all shards of a user is insufficient a small number of cross-shard transactions are required. On this basis, we propose a community overlap propagation algorithm for sharding. It defines the users' belonging coefficients of each shard and optimizes the state distribution so that the state distribution can better match the transaction characteristics between users. Finally, we develop an analysis framework for the sharding protocol and experiment with real Bitcoin transactions. The evaluation results show that compared to the state-of-the-art sharding protocol, Estuary reduces the ratio of cross-shard transactions by 88.54% and achieves more than 1.85 times the throughput improvement (92.98% of the theoretical upper limit).
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
情怀应助111采纳,获得10
刚刚
尊敬的晓亦完成签到,获得积分10
4秒前
Hello应助科研通管家采纳,获得10
4秒前
慕青应助科研通管家采纳,获得10
4秒前
4秒前
念念完成签到 ,获得积分10
6秒前
爆米花应助cyndi采纳,获得10
8秒前
一纸墨香完成签到 ,获得积分20
9秒前
yy123关注了科研通微信公众号
9秒前
科研通AI2S应助哈哈哈哈st采纳,获得10
14秒前
852应助lv采纳,获得10
14秒前
15秒前
orixero应助Chen采纳,获得10
16秒前
简栗弗斯完成签到 ,获得积分10
16秒前
zho发布了新的文献求助10
17秒前
黄少侠完成签到 ,获得积分10
18秒前
orixero应助peace采纳,获得10
18秒前
冰山未闯完成签到,获得积分10
20秒前
鹏鹏发布了新的文献求助10
20秒前
22秒前
krish发布了新的文献求助10
22秒前
在水一方应助lmy采纳,获得10
25秒前
26秒前
MFiWanting发布了新的文献求助10
26秒前
Leo完成签到,获得积分10
30秒前
31秒前
干净绝山发布了新的文献求助10
32秒前
32秒前
33秒前
lv发布了新的文献求助10
33秒前
绿大暗发布了新的文献求助10
34秒前
36秒前
37秒前
孤独君浩完成签到 ,获得积分20
37秒前
37秒前
cyndi发布了新的文献求助10
38秒前
我就是KKKK发布了新的文献求助10
39秒前
lmy发布了新的文献求助10
40秒前
krish完成签到,获得积分10
42秒前
高分求助中
One Man Talking: Selected Essays of Shao Xunmei, 1929–1939 1000
A Chronicle of Small Beer: The Memoirs of Nan Green 1000
From Rural China to the Ivy League: Reminiscences of Transformations in Modern Chinese History 900
Eric Dunning and the Sociology of Sport 850
QMS18Ed2 | process management. 2nd ed 800
Operative Techniques in Pediatric Orthopaedic Surgery 510
The Making of Détente: Eastern Europe and Western Europe in the Cold War, 1965-75 500
热门求助领域 (近24小时)
化学 医学 材料科学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 物理化学 催化作用 免疫学 细胞生物学 电极
热门帖子
关注 科研通微信公众号,转发送积分 2915190
求助须知:如何正确求助?哪些是违规求助? 2553333
关于积分的说明 6908441
捐赠科研通 2215092
什么是DOI,文献DOI怎么找? 1177567
版权声明 588353
科研通“疑难数据库(出版商)”最低求助积分说明 576443