ELS: Efficiency-Aware Dynamic Storage for Scalable Distributed Ledger

IF 4.9 2区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
IEEE Transactions on Computers Pub Date : 2026-02-01 Epub Date: 2025-10-28 DOI:10.1109/TC.2025.3626163
Keke Gai;Chennan Guo;Jing Yu;Qiang Xiao;Weilin Chan;Liehuang Zhu
{"title":"ELS: Efficiency-Aware Dynamic Storage for Scalable Distributed Ledger","authors":"Keke Gai;Chennan Guo;Jing Yu;Qiang Xiao;Weilin Chan;Liehuang Zhu","doi":"10.1109/TC.2025.3626163","DOIUrl":null,"url":null,"abstract":"Distributed Ledger Technology (DLT) has emerged as a promising solution for constructing decentralized and trustworthy platforms in recent years. Although blockchain, as a form of distributed ledger technology known for its tamper resistance and trustworthiness, seems to be an ideal solution for addressing trust issues, common blockchain systems face limitations due to the ever-growing volume of data. In this paper, we propose a dynamic storage scheme called <italic><u>E</u>fficiency-aware <u>L</u>ow-storage <u>S</u>calability</i> (ELS), which allocates variable data storage for the distributed ledgers. Our approach is designed to provide load balancing and security, allowing dynamic nodes to join or exit the network seamlessly. We utilize graph theory to group storage nodes in the blockchain by determining their network distances. These groups are then mapped into points in a two-dimensional virtual plane, meaning that block storage depends on the coordinates within the virtual plane. To balance storage performance with the evolving block allocation strategy, we develop a Voronoi diagram-based method to achieve near real-time adoptions that meet dynamic allocation requirements in blockchain systems. Experimental evaluations have demonstrated that our approach can reduce storage requirements by approximately 93% at each node, compared to full replication in 10000 block chains.","PeriodicalId":13087,"journal":{"name":"IEEE Transactions on Computers","volume":"75 2","pages":"462-476"},"PeriodicalIF":4.9000,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Computers","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11218955/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/10/28 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Distributed Ledger Technology (DLT) has emerged as a promising solution for constructing decentralized and trustworthy platforms in recent years. Although blockchain, as a form of distributed ledger technology known for its tamper resistance and trustworthiness, seems to be an ideal solution for addressing trust issues, common blockchain systems face limitations due to the ever-growing volume of data. In this paper, we propose a dynamic storage scheme called Efficiency-aware Low-storage Scalability (ELS), which allocates variable data storage for the distributed ledgers. Our approach is designed to provide load balancing and security, allowing dynamic nodes to join or exit the network seamlessly. We utilize graph theory to group storage nodes in the blockchain by determining their network distances. These groups are then mapped into points in a two-dimensional virtual plane, meaning that block storage depends on the coordinates within the virtual plane. To balance storage performance with the evolving block allocation strategy, we develop a Voronoi diagram-based method to achieve near real-time adoptions that meet dynamic allocation requirements in blockchain systems. Experimental evaluations have demonstrated that our approach can reduce storage requirements by approximately 93% at each node, compared to full replication in 10000 block chains.
ELS:可扩展分布式账本的效率感知动态存储
近年来,分布式账本技术(DLT)已成为构建分散和可信平台的一种有前途的解决方案。虽然区块链作为一种以其抗篡改和可信赖性而闻名的分布式账本技术,似乎是解决信任问题的理想解决方案,但由于数据量的不断增长,常见的区块链系统面临着限制。在本文中,我们提出了一种称为效率感知低存储可扩展性(ELS)的动态存储方案,该方案为分布式账本分配可变数据存储。我们的方法旨在提供负载平衡和安全性,允许动态节点无缝地加入或退出网络。我们利用图论通过确定区块链中的存储节点的网络距离来对它们进行分组。然后将这些组映射到二维虚拟平面中的点,这意味着块存储取决于虚拟平面内的坐标。为了平衡存储性能和不断发展的块分配策略,我们开发了一种基于Voronoi图的方法来实现接近实时的采用,以满足区块链系统中的动态分配需求。实验评估表明,与10000个区块链的完全复制相比,我们的方法可以将每个节点的存储需求减少约93%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Computers
IEEE Transactions on Computers 工程技术-工程:电子与电气
CiteScore
6.60
自引率
5.40%
发文量
199
审稿时长
6.0 months
期刊介绍: The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field. It publishes papers on research in areas of current interest to the readers. These areas include, but are not limited to, the following: a) computer organizations and architectures; b) operating systems, software systems, and communication protocols; c) real-time systems and embedded systems; d) digital devices, computer components, and interconnection networks; e) specification, design, prototyping, and testing methods and tools; f) performance, fault tolerance, reliability, security, and testability; g) case studies and experimental and theoretical evaluations; and h) new and important applications and trends.
×
引用
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学术官方微信
小红书