Article
Version 1
Preserved in Portico This version is not peer-reviewed
Solving Confirmation Time in Sharded Blockchain with PFQN
Version 1
: Received: 19 March 2024 / Approved: 19 March 2024 / Online: 19 March 2024 (16:06:53 CET)
A peer-reviewed article of this Preprint also exists.
Wu, J.; Du, H.; Chen, J.; Ren, W. Solving Confirmation Time in Sharded Blockchain with PFQN. Electronics 2024, 13, 1220. Wu, J.; Du, H.; Chen, J.; Ren, W. Solving Confirmation Time in Sharded Blockchain with PFQN. Electronics 2024, 13, 1220.
Abstract
Sharding shows great potential for extending the blockchain. The current challenge facing sharded blockchain technology lies in addressing the extended transaction confirmation times caused by isolated states between shards and unbalanced transaction allocation strategies. These factors contribute to an increase in cross-shard transactions and disproportionate shard workload, ultimately resulting in indefinite confirmation delays for cross-shard transactions. A critical priority for sharded blockchain systems is to conduct a comprehensive qualitative analysis to better understand and mitigate the prolonged transaction confirmation times. We introduce a Product-Form Queue Network (PFQN) model to address the transaction confirmation time problem in sharded blockchains and incorporate a new confirmation queue to more accurately simulate the actual transaction confirmation process in the blockchain. In addition, we provide a detailed quantitative analysis of the relationship between network load, consensus efficiency, and security in sharded blockchains, laying a theoretical foundation for achieving robustness and efficiency in sharded blockchains. This research not only contributes to addressing the scalability issues in sharded blockchains but also offers a new perspective for future research directions.
Keywords
blockchain sharding; transaction confirmation time; cross-shard transactions; product-form queue network
Subject
Computer Science and Mathematics, Computer Networks and Communications
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment