Dynamic sharding model and performance optimization method for consortium blockchain

Consortium blockchain has been widely used in finance, e-government due to the characteristics of controllability, supervision, and operability. However, traditional consortium blockchains have bottlenecks in throughput. To solve the bottlenecks, the paper proposes a Dynamic Sharding Model and Perfo...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	The Journal of supercomputing 2025-01, Vol.81 (2), Article 411
Hauptverfasser:	Wang, Yan, Gong, Zheng, Jia, Dayu, Tan, Aiping, Liu, Minchao
Format:	Artikel
Sprache:	eng
Schlagworte:	Blockchain Clustering Computer architecture Consortia Electronic government Optimization Redundancy
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page
container_issue	2
container_start_page
container_title	The Journal of supercomputing
container_volume	81
creator	Wang, Yan Gong, Zheng Jia, Dayu Tan, Aiping Liu, Minchao
description	Consortium blockchain has been widely used in finance, e-government due to the characteristics of controllability, supervision, and operability. However, traditional consortium blockchains have bottlenecks in throughput. To solve the bottlenecks, the paper proposes a Dynamic Sharding Model and Performance Optimization Method for Consortium Blockchain (DSPO-CB), which offers a new shard architecture and dynamically optimizes the architecture through the Deep Q-Network (DQN). Firstly, the model reduces redundancy and improves space utilization by classifying the nodes ensuring security. Secondly, the model proposes the shard structure through a dynamic clustering method based on the node status to reduce the proportion of cross-shard transactions. Finally, the DQN is used to dynamically optimize the sharding and consensus architecture. Experiments show that DSPO-CB improves the throughput by 33% and saves up to 78% storage space compared with the existing consortium blockchain.
doi_str_mv	10.1007/s11227-024-06870-8
format	Article
fullrecord	<record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3158037761</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3158037761</sourcerecordid><originalsourceid>FETCH-LOGICAL-c156t-e0fa41e272354ca6ca33ce40d7995e172362609d5e9331d63a23b99131f13f633</originalsourceid><addsrcrecordid>eNpNkMtOwzAQRS0EEuXxA6wssQ7MeBI7WaLylCqxKWvLdRzq0tjBThfl6wmUBas7unM0Ix3GrhBuEEDdZkQhVAGiLEDWCor6iM2wUlRAWZfH_-ZTdpbzBgBKUjRjy_t9ML23PK9Nan14531s3Zab0PLBpS6m3gTreBxG3_svM_oYeO_GdWz5tOQ2hhzT6Hc9X22j_bBr48MFO-nMNrvLvzxnb48Py_lzsXh9epnfLQqLlRwLB50p0QklqCqtkdYQWVdCq5qmcjjVUkho2so1RNhKMoJWTYOEHVInic7Z9eHukOLnzuVRb-IuhemlJqxqIKUkTpQ4UDbFnJPr9JB8b9JeI-gfe_pgT0_29K89XdM3-jNidQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3158037761</pqid></control><display><type>article</type><title>Dynamic sharding model and performance optimization method for consortium blockchain</title><source>Springer Nature - Complete Springer Journals</source><creator>Wang, Yan ; Gong, Zheng ; Jia, Dayu ; Tan, Aiping ; Liu, Minchao</creator><creatorcontrib>Wang, Yan ; Gong, Zheng ; Jia, Dayu ; Tan, Aiping ; Liu, Minchao</creatorcontrib><description>Consortium blockchain has been widely used in finance, e-government due to the characteristics of controllability, supervision, and operability. However, traditional consortium blockchains have bottlenecks in throughput. To solve the bottlenecks, the paper proposes a Dynamic Sharding Model and Performance Optimization Method for Consortium Blockchain (DSPO-CB), which offers a new shard architecture and dynamically optimizes the architecture through the Deep Q-Network (DQN). Firstly, the model reduces redundancy and improves space utilization by classifying the nodes ensuring security. Secondly, the model proposes the shard structure through a dynamic clustering method based on the node status to reduce the proportion of cross-shard transactions. Finally, the DQN is used to dynamically optimize the sharding and consensus architecture. Experiments show that DSPO-CB improves the throughput by 33% and saves up to 78% storage space compared with the existing consortium blockchain.</description><identifier>ISSN: 1573-0484</identifier><identifier>ISSN: 0920-8542</identifier><identifier>EISSN: 1573-0484</identifier><identifier>DOI: 10.1007/s11227-024-06870-8</identifier><language>eng</language><publisher>New York: Springer Nature B.V</publisher><subject>Blockchain ; Clustering ; Computer architecture ; Consortia ; Electronic government ; Optimization ; Redundancy</subject><ispartof>The Journal of supercomputing, 2025-01, Vol.81 (2), Article 411</ispartof><rights>Copyright Springer Nature B.V. 2025</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c156t-e0fa41e272354ca6ca33ce40d7995e172362609d5e9331d63a23b99131f13f633</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Wang, Yan</creatorcontrib><creatorcontrib>Gong, Zheng</creatorcontrib><creatorcontrib>Jia, Dayu</creatorcontrib><creatorcontrib>Tan, Aiping</creatorcontrib><creatorcontrib>Liu, Minchao</creatorcontrib><title>Dynamic sharding model and performance optimization method for consortium blockchain</title><title>The Journal of supercomputing</title><description>Consortium blockchain has been widely used in finance, e-government due to the characteristics of controllability, supervision, and operability. However, traditional consortium blockchains have bottlenecks in throughput. To solve the bottlenecks, the paper proposes a Dynamic Sharding Model and Performance Optimization Method for Consortium Blockchain (DSPO-CB), which offers a new shard architecture and dynamically optimizes the architecture through the Deep Q-Network (DQN). Firstly, the model reduces redundancy and improves space utilization by classifying the nodes ensuring security. Secondly, the model proposes the shard structure through a dynamic clustering method based on the node status to reduce the proportion of cross-shard transactions. Finally, the DQN is used to dynamically optimize the sharding and consensus architecture. Experiments show that DSPO-CB improves the throughput by 33% and saves up to 78% storage space compared with the existing consortium blockchain.</description><subject>Blockchain</subject><subject>Clustering</subject><subject>Computer architecture</subject><subject>Consortia</subject><subject>Electronic government</subject><subject>Optimization</subject><subject>Redundancy</subject><issn>1573-0484</issn><issn>0920-8542</issn><issn>1573-0484</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2025</creationdate><recordtype>article</recordtype><recordid>eNpNkMtOwzAQRS0EEuXxA6wssQ7MeBI7WaLylCqxKWvLdRzq0tjBThfl6wmUBas7unM0Ix3GrhBuEEDdZkQhVAGiLEDWCor6iM2wUlRAWZfH_-ZTdpbzBgBKUjRjy_t9ML23PK9Nan14531s3Zab0PLBpS6m3gTreBxG3_svM_oYeO_GdWz5tOQ2hhzT6Hc9X22j_bBr48MFO-nMNrvLvzxnb48Py_lzsXh9epnfLQqLlRwLB50p0QklqCqtkdYQWVdCq5qmcjjVUkho2so1RNhKMoJWTYOEHVInic7Z9eHukOLnzuVRb-IuhemlJqxqIKUkTpQ4UDbFnJPr9JB8b9JeI-gfe_pgT0_29K89XdM3-jNidQ</recordid><startdate>20250101</startdate><enddate>20250101</enddate><creator>Wang, Yan</creator><creator>Gong, Zheng</creator><creator>Jia, Dayu</creator><creator>Tan, Aiping</creator><creator>Liu, Minchao</creator><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20250101</creationdate><title>Dynamic sharding model and performance optimization method for consortium blockchain</title><author>Wang, Yan ; Gong, Zheng ; Jia, Dayu ; Tan, Aiping ; Liu, Minchao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c156t-e0fa41e272354ca6ca33ce40d7995e172362609d5e9331d63a23b99131f13f633</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2025</creationdate><topic>Blockchain</topic><topic>Clustering</topic><topic>Computer architecture</topic><topic>Consortia</topic><topic>Electronic government</topic><topic>Optimization</topic><topic>Redundancy</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Yan</creatorcontrib><creatorcontrib>Gong, Zheng</creatorcontrib><creatorcontrib>Jia, Dayu</creatorcontrib><creatorcontrib>Tan, Aiping</creatorcontrib><creatorcontrib>Liu, Minchao</creatorcontrib><collection>CrossRef</collection><jtitle>The Journal of supercomputing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Yan</au><au>Gong, Zheng</au><au>Jia, Dayu</au><au>Tan, Aiping</au><au>Liu, Minchao</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Dynamic sharding model and performance optimization method for consortium blockchain</atitle><jtitle>The Journal of supercomputing</jtitle><date>2025-01-01</date><risdate>2025</risdate><volume>81</volume><issue>2</issue><artnum>411</artnum><issn>1573-0484</issn><issn>0920-8542</issn><eissn>1573-0484</eissn><abstract>Consortium blockchain has been widely used in finance, e-government due to the characteristics of controllability, supervision, and operability. However, traditional consortium blockchains have bottlenecks in throughput. To solve the bottlenecks, the paper proposes a Dynamic Sharding Model and Performance Optimization Method for Consortium Blockchain (DSPO-CB), which offers a new shard architecture and dynamically optimizes the architecture through the Deep Q-Network (DQN). Firstly, the model reduces redundancy and improves space utilization by classifying the nodes ensuring security. Secondly, the model proposes the shard structure through a dynamic clustering method based on the node status to reduce the proportion of cross-shard transactions. Finally, the DQN is used to dynamically optimize the sharding and consensus architecture. Experiments show that DSPO-CB improves the throughput by 33% and saves up to 78% storage space compared with the existing consortium blockchain.</abstract><cop>New York</cop><pub>Springer Nature B.V</pub><doi>10.1007/s11227-024-06870-8</doi></addata></record>
fulltext	fulltext
identifier	ISSN: 1573-0484
ispartof	The Journal of supercomputing, 2025-01, Vol.81 (2), Article 411
issn	1573-0484 0920-8542 1573-0484
language	eng
recordid	cdi_proquest_journals_3158037761
source	Springer Nature - Complete Springer Journals
subjects	Blockchain Clustering Computer architecture Consortia Electronic government Optimization Redundancy
title	Dynamic sharding model and performance optimization method for consortium blockchain
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T18%3A54%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Dynamic%20sharding%20model%20and%20performance%20optimization%20method%20for%20consortium%20blockchain&rft.jtitle=The%20Journal%20of%20supercomputing&rft.au=Wang,%20Yan&rft.date=2025-01-01&rft.volume=81&rft.issue=2&rft.artnum=411&rft.issn=1573-0484&rft.eissn=1573-0484&rft_id=info:doi/10.1007/s11227-024-06870-8&rft_dat=%3Cproquest_cross%3E3158037761%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3158037761&rft_id=info:pmid/&rfr_iscdi=true