Jul 2026· Fall Joint Computer Conference· pp. 444-449· 0 citations· 15 references
Abstract
Blockchain represents a critical technical solution for achieving reliable and trustworthy distributed storage in JointCloud computing. Sharding technology can enhance the scalability of blockchain. However, while improving throughput, the massive cross-shard transactions introduced by sharding have become a new performance bottleneck. To mitigate this problem, state-of-the-art studies have adopted account migration strategies to reduce the amount of cross-shard transactions, nevertheless, prevailing methodologies depend on lock mechanisms that result in significant latency overhead for locked transactions. This work proposes Segment-Account Migration (SAM), an efficient lock-free account migration protocol by segmenting the account balance, retaining a portion on the source shard to support payer transactions while transferring the remainder and the account state to the target shard, thereby eliminating transaction locks during migration. Furthermore, the SAM protocol introduces a time window-based rollback mechanism to handle migration failures and defend against replay attacks. Experiments on the Ethereum dataset demonstrate that SAM reduces the average completion time of related-party transactions by 24.85% and decreases the average amount of state synchronization data by 34.65%. This significant improvement enhances migration efficiency while maintaining security, offering a reliable and effective solution for the scalability of sharded blockchains.
Existing sharded blockchain systems suffer from excessive cross-shard communication overhead and workload imbalance. Although state-of-the-art account allocation schemes partially alleviate these problems, they still fail to simultaneously achieve effective cross-shard transaction reduction and balanced workload distri...
Zitong Zhang, Hao-Xiang Han, Chao-Ming Shi et al.· IEEE Transactions on Network...· 0 citations
LB-Louvain is presented, a coarse-to-fine account-partitioning heuristic in which standard Louvain first extracts logical communities, followed by load-aware community-to-shard assignment and restricted boundary-account refinement, and component-wise ablation confirms complementary roles for load-aware assignment and b...
Zhen-Xing Luan, Jia-Hui Du, Kuan Fan· Applied Sciences· 0 citations
Blockchain-based forensic evidence management for Industrial Internet of Things (IIoT) environments requires tamper-evident custody records and accountable interorganizational access. Yet, Hyperledger Fabric evaluations often use generic workloads or treat retrieval as a passive query, limiting evidence on ordering beh...
Diyanatul Husna, Alaa M. Allakany, K. Okamura· Information· 0 citations
Permissioned blockchains deployed in modern cloud and data-center environments increasingly adopt speculative parallel execution to decouple transaction execution from consensus ordering. This design implicitly relies on the sequencer's canonical transaction instance reaching execution replicas before any competing ins...
Tao Tong, Qing-Kai Meng, Zi-Yang Zheng et al.· 2026 IEEE/CIC International...· 0 citations
Blockchain sharding partitions network state and transaction load across multiple parallel subchains (shards) in order to overcome the throughput ceiling of monolithic consensus protocols. In this study, we develop a mathematical performance model for blockchain sharding in which the underlying persistence layer is rea...
Divyesh Bhatnagar, Anil Gupta· JANOLI International Journal...· 0 citations
Blockchain applications rely on consensus protocols to maintain security, integrity, and coordination in decentralized environments while balancing performance, scalability, and resource cost. This study presents a comparative evaluation of four Hyperledger Besu consensus algorithms, namely Ethash, Clique, QBFT, and IB...
Muhammet Furkan Ozara, A. Akbulut, Mustafa Kara et al.· Applied Sciences· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.