{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:59:28Z","timestamp":1773511168191,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:00:00Z","timestamp":1737417600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:00:00Z","timestamp":1737417600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"The Key Science and Technology Program of the Open Competition Mechanism to Select the Best Candidates of Liaoning Province, China","award":["No.2021JH1\/10400010"],"award-info":[{"award-number":["No.2021JH1\/10400010"]}]},{"name":"The Key Science and Technology Program of the Open Competition Mechanism to Select the Best Candidates of Liaoning Province, China","award":["No.2021JH1\/10400010"],"award-info":[{"award-number":["No.2021JH1\/10400010"]}]},{"name":"The Key Science and Technology Program of the Open Competition Mechanism to Select the Best Candidates of Liaoning Province, China","award":["No.2021JH1\/10400010"],"award-info":[{"award-number":["No.2021JH1\/10400010"]}]},{"name":"The Key Science and Technology Program of the Open Competition Mechanism to Select the Best Candidates of Liaoning Province, China","award":["No.2021JH1\/10400010"],"award-info":[{"award-number":["No.2021JH1\/10400010"]}]},{"name":"The Key Science and Technology Program of the Open Competition Mechanism to Select the Best Candidates of Liaoning Province, China","award":["No.2021JH1\/10400010"],"award-info":[{"award-number":["No.2021JH1\/10400010"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-024-06870-8","type":"journal-article","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T12:00:55Z","timestamp":1737460855000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Dynamic sharding model and performance optimization method for consortium blockchain"],"prefix":"10.1007","volume":"81","author":[{"given":"Yan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dayu","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aiping","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minchao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,21]]},"reference":[{"issue":"1 &2","key":"6870_CR1","first-page":"51","volume":"11","author":"O Dib","year":"2018","unstructured":"Dib O, Brousmiche K-L, Durand A, Thea E, Hamida EB (2018) Consortium blockchains: overview, applications and challenges. Int J Advan Telecommun 11(1 &2):51\u201364","journal-title":"Int J Advan Telecommun"},{"issue":"17","key":"6870_CR2","doi-asserted-by":"publisher","first-page":"20041","DOI":"10.1007\/s11227-023-05414-w","volume":"79","author":"T Shen","year":"2023","unstructured":"Shen T, Li T, Yu Z, Bai F, Zhang C (2023) GT-NRSM: efficient and scalable sharding consensus mechanism for consortium blockchain. J Supercomput 79(17):20041\u201320075","journal-title":"J Supercomput"},{"key":"6870_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.ins.2019.04.011","volume":"491","author":"Z Tian","year":"2019","unstructured":"Tian Z, Li M, Qiu M, Sun Y, Su S (2019) Block-def: a secure digital evidence framework using blockchain. Inf Sci 491:151\u2013165","journal-title":"Inf Sci"},{"key":"6870_CR4","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.ins.2020.05.087","volume":"540","author":"Y Pu","year":"2020","unstructured":"Pu Y, Xiang T, Hu C, Alrawais A, Yan H (2020) An efficient blockchain-based privacy preserving scheme for vehicular social networks. Inf Sci 540:308\u2013324","journal-title":"Inf Sci"},{"issue":"1","key":"6870_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.14778\/3561261.3561264","volume":"16","author":"C Wu","year":"2022","unstructured":"Wu C, Amiri MJ, Asch J, Nagda H, Zhang Q, Loo BT (2022) Flexchain: an elastic disaggregated blockchain. Proc VLDB Endow 16(1):23\u201336","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"6870_CR6","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TSC.2019.2948009","volume":"13","author":"B Huang","year":"2019","unstructured":"Huang B, Jin L, Lu Z, Zhou X, Wu J, Tang Q, Hung PC (2019) Bor: toward high-performance permissioned blockchain in rdma-enabled network. IEEE Trans Serv Computing 13(2):301\u2013313","journal-title":"IEEE Trans Serv Computing"},{"key":"6870_CR7","unstructured":"Gouk D, Lee S, Kwon M, Jung M (2022) Direct access, high-performance memory disaggregation with directcxl. USENIX ATC, 287\u2013294"},{"key":"6870_CR8","doi-asserted-by":"crossref","unstructured":"Huang Y, Huang Y, Yan M, Hu J, Liang C, Xu Y, Zou W, Zhang Y, Zhang R, Huang C, Wu J (2022) An ultra-low latency and compatible pcie interconnect for rack-scale communication. CoNEXT, 232\u2013244","DOI":"10.1145\/3555050.3569128"},{"issue":"3","key":"6870_CR9","first-page":"273","volume":"47","author":"J Pan","year":"2020","unstructured":"Pan J, Huang D (2020) Blockchain dynamic sharding model based on jump hash and asynchronous consensus group. Comput Sci 47(3):273\u2013280","journal-title":"Comput Sci"},{"key":"6870_CR10","doi-asserted-by":"crossref","unstructured":"Zhou Z, Qiu Z, Yu Q, Chen H (2020) A dynamic sharding protocol design for consortium blockchains. In: 2020 IEEE International Conference on Big Data (Big Data), pp. 2590\u20132595. IEEE","DOI":"10.1109\/BigData50022.2020.9377899"},{"issue":"1","key":"6870_CR11","first-page":"183","volume":"42","author":"L Li","year":"2022","unstructured":"Li L, Wu Y, Yang Z, Chen Y (2022) Medical electronic record sharing scheme based on sharding-based blockchain. J Comput Appl 42(1):183","journal-title":"J Comput Appl"},{"key":"6870_CR12","doi-asserted-by":"crossref","unstructured":"Zheng P, Xu Q, Zheng Z, Zhou Z, Yan Y, Zhang H (2021) Meepo: Sharded consortium blockchain. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 1847\u20131852. IEEE","DOI":"10.1109\/ICDE51399.2021.00165"},{"key":"6870_CR13","first-page":"2068","volume":"2024","author":"F Cheng","year":"2024","unstructured":"Cheng F, Xiao J, Liu C, Zhang S, Zhou Y, Li B, Li B, Jin H (2024) Shardag: scaling dag-based blockchains via adaptive sharding. ICDE 2024:2068\u20132081","journal-title":"ICDE"},{"issue":"4","key":"6870_CR14","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1109\/TPDS.2024.3361180","volume":"35","author":"J Xu","year":"2024","unstructured":"Xu J, Ming Y, Wu Z, Wang C, Jia X (2024) X-shard: optimistic cross-shard transaction processing for sharding-based blockchains. IEEE Trans Parallel Distributed Syst 35(4):548\u2013559","journal-title":"IEEE Trans Parallel Distributed Syst"},{"key":"6870_CR15","doi-asserted-by":"crossref","unstructured":"Xu Z, Tang J, Meng J, Zhang W, Wang Y, Liu CH, Yang D (2018) Experience-driven networking: A deep reinforcement learning based approach. In: IEEE INFOCOM 2018-IEEE Conference on Computer Communications, pp. 1871\u20131879. IEEE","DOI":"10.1109\/INFOCOM.2018.8485853"},{"issue":"7540","key":"6870_CR16","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Rusu AA, Veness J, Bellemare MG, Graves A, Riedmiller M, Fidjeland AK, Ostrovski G et al (2015) Human-level control through deep reinforcement learning. Nature 518(7540):529\u2013533","journal-title":"Nature"},{"issue":"1","key":"6870_CR17","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TSMC.2019.2895471","volume":"50","author":"D Huang","year":"2019","unstructured":"Huang D, Ma X, Zhang S (2019) Performance analysis of the raft consensus algorithm for private blockchains. IEEE Trans Syst Man Cybern: Syst 50(1):172\u2013181","journal-title":"IEEE Trans Syst Man Cybern: Syst"},{"issue":"2","key":"6870_CR18","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1109\/JIOT.2020.3006896","volume":"8","author":"J Yun","year":"2020","unstructured":"Yun J, Goh Y, Chung J-M (2020) Dqn-based optimization framework for secure sharded blockchain systems. IEEE Internet of Things J 8(2):708\u2013722","journal-title":"IEEE Internet of Things J"},{"key":"6870_CR19","doi-asserted-by":"publisher","first-page":"15882","DOI":"10.1007\/s11227-022-04514-3","volume":"78","author":"T Geng","year":"2022","unstructured":"Geng T, Du Y (2022) Applying the blockchain-based deep reinforcement consensus algorithm to the intelligent manufacturing model under internet of things. The Journal of Supercomput 78:15882\u201315904","journal-title":"The Journal of Supercomput"},{"key":"6870_CR20","first-page":"716","volume":"2016","author":"T Duong","year":"2016","unstructured":"Duong T, Fan L, Veale T, Zhou H-S (2016) Securing bitcoin-like backbone protocols against a malicious majority of computing power. IACR Cryptol. ePrint Arch. 2016:716","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"6870_CR21","doi-asserted-by":"crossref","unstructured":"Baek J, Zheng Y (2004) Identity-based threshold signature scheme from the bilinear pairings. In: International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004., vol. 1, pp. 124\u2013128. IEEE","DOI":"10.1109\/ITCC.2004.1286437"},{"issue":"4","key":"6870_CR22","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1049\/cje.2021.05.011","volume":"30","author":"C Nan","year":"2021","unstructured":"Nan C, Shengli L (2021) Message authentication codes against related-key attacks under lpn and lwe. Chin J Electron 30(4):697\u2013703","journal-title":"Chin J Electron"},{"key":"6870_CR23","doi-asserted-by":"crossref","unstructured":"Lamport L, Shostak R, Pease M (2019) The byzantine generals problem. In: Concurrency: the Works of Leslie Lamport, pp. 203\u2013226","DOI":"10.1145\/3335772.3335936"},{"key":"6870_CR24","unstructured":"Schaul T, Quan J, Antonoglou I, Silver D (2015) Prioritized experience replay. arXiv preprint arXiv:1511.05952"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06870-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06870-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06870-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T12:01:07Z","timestamp":1737460867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06870-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,21]]},"references-count":24,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,1]]}},"alternative-id":["6870"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06870-8","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,21]]},"assertion":[{"value":"19 December 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}],"article-number":"411"}}