Open Access iconOpen Access

ARTICLE

crossmark

A Sharding Scheme Based on Graph Partitioning Algorithm for Public Blockchain

Shujiang Xu1,2,*, Ziye Wang1,2, Lianhai Wang1,2, Miodrag J. Mihaljević1,2,3, Shuhui Zhang1,2, Wei Shao1,2, Qizheng Wang1,2

1 Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center, Qilu University of Technology (Shandong Academy of Sciences), Jinan, 250014, China
2 Shandong Provincial Key Laboratory of Computer Networks, Shandong Fundamental Research Center for Computer Science, Jinan, 250014, China
3 Mathematical Institute, The Serbian Academy of Sciences and Arts, Belgrade, 11000, Serbia

* Corresponding Author: Shujiang Xu. Email: email

(This article belongs to the Special Issue: The Bottleneck of Blockchain Techniques: Scalability, Security and Privacy Protection)

Computer Modeling in Engineering & Sciences 2024, 139(3), 3311-3327. https://doi.org/10.32604/cmes.2023.046164

Abstract

Blockchain technology, with its attributes of decentralization, immutability, and traceability, has emerged as a powerful catalyst for enhancing traditional industries in terms of optimizing business processes. However, transaction performance and scalability has become the main challenges hindering the widespread adoption of blockchain. Due to its inability to meet the demands of high-frequency trading, blockchain cannot be adopted in many scenarios. To improve the transaction capacity, researchers have proposed some on-chain scaling technologies, including lightning networks, directed acyclic graph technology, state channels, and sharding mechanisms, in which sharding emerges as a potential scaling technology. Nevertheless, excessive cross-shard transactions and uneven shard workloads prevent the sharding mechanism from achieving the expected aim. This paper proposes a graph-based sharding scheme for public blockchain to efficiently balance the transaction distribution. By mitigating cross-shard transactions and evening-out workloads among shards, the scheme reduces transaction confirmation latency and enhances the transaction capacity of the blockchain. Therefore, the scheme can achieve a high-frequency transaction as well as a better blockchain scalability. Experiments results show that the scheme effectively reduces the cross-shard transaction ratio to a range of 35%–56% and significantly decreases the transaction confirmation latency to 6 s in a blockchain with no more than 25 shards.

Graphical Abstract

A Sharding Scheme Based on Graph Partitioning Algorithm for Public Blockchain

Keywords


Cite This Article

APA Style
Xu, S., Wang, Z., Wang, L., Mihaljević, M.J., Zhang, S. et al. (2024). A sharding scheme based on graph partitioning algorithm for public blockchain. Computer Modeling in Engineering & Sciences, 139(3), 3311-3327. https://doi.org/10.32604/cmes.2023.046164
Vancouver Style
Xu S, Wang Z, Wang L, Mihaljević MJ, Zhang S, Shao W, et al. A sharding scheme based on graph partitioning algorithm for public blockchain. Comp Model Eng. 2024;139(3):3311-3327 https://doi.org/10.32604/cmes.2023.046164
IEEE Style
S. Xu et al., "A Sharding Scheme Based on Graph Partitioning Algorithm for Public Blockchain," Comp. Model. Eng., vol. 139, no. 3, pp. 3311-3327. 2024. https://doi.org/10.32604/cmes.2023.046164



cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 519

    View

  • 199

    Download

  • 0

    Like

Share Link