Research on transaction allocation strategy in blockchain state sharding

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS Future Generation Computer Systems-The International Journal of Escience Pub Date : 2025-07-01 Epub Date: 2025-02-15 DOI:10.1016/j.future.2025.107756
Guangxia Xu , Zhean Zhou , Xiaoling Song , Yongfei Huang
{"title":"Research on transaction allocation strategy in blockchain state sharding","authors":"Guangxia Xu ,&nbsp;Zhean Zhou ,&nbsp;Xiaoling Song ,&nbsp;Yongfei Huang","doi":"10.1016/j.future.2025.107756","DOIUrl":null,"url":null,"abstract":"<div><div>With the continuous enrichment of blockchain application scenarios, people have higher requirements for blockchain throughput and storage costs. State sharding is one of the most promising technologies for blockchain. It decentralizes the storage of the blockchain ledger to effectively reduce storage costs while increasing the throughput of the blockchain. However, it still has the hot sharding problem of most transactions in individual committees. This paper proposes a sharding transaction allocation strategy (STAS) to score committees and transactions according to different methods and assign high-scoring transactions to high-scoring committees. This allocation strategy, which allocates transactions on demand based on node capacity, mitigates hot sharding issues and makes it safer to hand over more valuable transactions to a more honest committee. Comparative experiments show that the proposed STAS strategy has lower latency and higher throughput than the previous sharding model.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"168 ","pages":"Article 107756"},"PeriodicalIF":6.2000,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Generation Computer Systems-The International Journal of Escience","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167739X25000512","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/15 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

With the continuous enrichment of blockchain application scenarios, people have higher requirements for blockchain throughput and storage costs. State sharding is one of the most promising technologies for blockchain. It decentralizes the storage of the blockchain ledger to effectively reduce storage costs while increasing the throughput of the blockchain. However, it still has the hot sharding problem of most transactions in individual committees. This paper proposes a sharding transaction allocation strategy (STAS) to score committees and transactions according to different methods and assign high-scoring transactions to high-scoring committees. This allocation strategy, which allocates transactions on demand based on node capacity, mitigates hot sharding issues and makes it safer to hand over more valuable transactions to a more honest committee. Comparative experiments show that the proposed STAS strategy has lower latency and higher throughput than the previous sharding model.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
区块链状态分片中事务分配策略研究
随着区块链应用场景的不断丰富,人们对区块链吞吐量和存储成本提出了更高的要求。状态分片是区块链最有前途的技术之一。它将区块链账本的存储去中心化,在提高区块链吞吐量的同时有效降低了存储成本。然而,它仍然存在大多数事务在单个委员会中的热分片问题。本文提出了一种分片交易分配策略(STAS),根据不同的方法对委员会和交易进行打分,并将高分交易分配给高分委员会。这种分配策略根据节点容量按需分配交易,缓解了热分片问题,并使将更有价值的交易移交给更诚实的委员会更安全。对比实验表明,与之前的分片模型相比,本文提出的STAS策略具有更低的延迟和更高的吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
19.90
自引率
2.70%
发文量
376
审稿时长
10.6 months
期刊介绍: Computing infrastructures and systems are constantly evolving, resulting in increasingly complex and collaborative scientific applications. To cope with these advancements, there is a growing need for collaborative tools that can effectively map, control, and execute these applications. Furthermore, with the explosion of Big Data, there is a requirement for innovative methods and infrastructures to collect, analyze, and derive meaningful insights from the vast amount of data generated. This necessitates the integration of computational and storage capabilities, databases, sensors, and human collaboration. Future Generation Computer Systems aims to pioneer advancements in distributed systems, collaborative environments, high-performance computing, and Big Data analytics. It strives to stay at the forefront of developments in grids, clouds, and the Internet of Things (IoT) to effectively address the challenges posed by these wide-area, fully distributed sensing and computing systems.
期刊最新文献
Blockchain architectures for enhancing EV infrastructure security: A unified framework for addressing sophisticated cyber-attacks Applying quantum error-correcting codes for fault-tolerant blind quantum cloud computation A swarm intelligence enabled multi-agent reinforcement learning scheme for computational task offloading in internet of things blockchain KnowAIDE: A fAIR-compliant data environment to accelerate AI research Non-intrusive kernel-level dispatching for MQTT shared subscriptions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1