Optimizing Blockchain Shard Allocations Service: A Multi-Objective Evolutionary Perspective
IEEE Transactions on Services Computing · 2025-09 · 18 (5) · 3065-3078
DOI: 10.1109/tsc.2025.3597191 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Services Computing, 2025-09. Verfasst von Kun Zhou und 4 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 39 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Key Program of Nature Science Foundation of Zhejiang Province, Nature Science Foundation of Zhejiang Province.
Abstract (Originalsprache)
Sharding is one of the most effective techniques for addressing scalability challenges in blockchain systems. However, existing sharding schemes often fail to balance security and scalability, primarily due to unavoidable cross-shard communication costs. Some schemes rely on additional roles like TEEs or alliances to streamline cross-shard consensus, introducing security risks such as hardware attacks or node collusion. Others mitigate cross-shard consensus costs by periodically distributing nodes or states based on predefined rules, yet inefficient distribution rules lead to poor scalability. In response, this article proposes SAC, a novel sharding allocation service that efficiently trades scalability and security via a two-stage allocation strategy. First, SAC employs lightweight state graph clustering to group frequently interacting states within the same shards based on historical transaction data, reducing cross-shard transactions significantly. Second, it formulates node allocation as a multi-objective evolutionary problem (MoSA) that jointly maximizes system throughput, minimizes confirmation latency, and balances malicious node distribution. Next, SAC selects FV-MOEA as the foundational solver for MoSA after comprehensive preliminary experiments. Based on this, SAC proposes an improved algorithm, LeFV, to explore optimal shard allocation solutions. Specifically, LeFV retains and mutates low-contributing but potentially high-quality solutions to enhance population diversity. It allows for a wider exploration of shard allocations, thereby identifying optimal ones that effectively balance scalability and security of the sharding system. Extensive experiments on a sophisticated blockchain emulator demonstrate that SAC outperforms two advanced state-of-the-art methods in balancing scalability and security.
Förderung
- National Natural Science Foundation of China
- Key Program of Nature Science Foundation of Zhejiang Province
- Nature Science Foundation of Zhejiang Province
- Leading Goose Project Plan” of Zhejiang Province
- Distinguished Expert Program of Xinjiang Province
- National Key R&D Program of China
Zitieren
APA
Zhou, K., Cheng, H., Xu, Z., Gao, J., & Chen, H. (2025). Optimizing Blockchain Shard Allocations Service: A Multi-Objective Evolutionary Perspective. IEEE Transactions on Services Computing, 18(5), 3065-3078. https://doi.org/10.1109/tsc.2025.3597191
Vancouver
Zhou K, Cheng H, Xu Z, Gao J, Chen H. Optimizing Blockchain Shard Allocations Service: A Multi-Objective Evolutionary Perspective. IEEE Transactions on Services Computing. 2025;18(5):3065-3078. doi:10.1109/tsc.2025.3597191
BibTeX
@article{Zhou2025,
author = {Zhou, Kun and Cheng, Hongbing and Xu, Zhicheng and Gao, Jie and Chen, Huixin},
title = {Optimizing Blockchain Shard Allocations Service: A Multi-Objective Evolutionary Perspective},
journal = {IEEE Transactions on Services Computing},
year = {2025},
volume = {18},
number = {5},
pages = {3065--3078},
doi = {10.1109/tsc.2025.3597191}
}
EUVIMED