BIND: Enabling Continuous Transaction Processing During Account Migration in Sharded Blockchains

摘要

Account migration in sharded blockchains presents a critical trade-off between optimization effectiveness and system availability. While dynamically reallocating accounts across shards can significantly reduce cross-shard transaction overhead, existing migration mechanisms cause service disruptions that intensify as state data volumes grow. To address this challenge, we propose BIND, a batch-wise account migration protocol that eliminates service interruptions by enabling continuous transaction processing throughout migration. BIND introduces a dual transaction pool architecture that isolates transactions involving migrating accounts while allowing non-migrating accounts to operate uninterrupted. To optimize migration efficiency, we design a reverse greedy heuristic algorithm that partitions accounts into batches based on community cohesion, maximizing intra-batch connectivity to front-load cross-shard communication reduction. We evaluate BIND using real Ethereum transactions, demonstrating superior performance over existing mechanisms. BIND achieves 12% higher overall throughput, reduces migration time to 23.6%-39.3% of the one-shot baseline (across 1-10Gbps bandwidth), and lowers cross-shard transaction rates by 24.1% compared to random batching. These results confirm BIND as a practical solution for large-scale, non-disruptive account migration in production sharded blockchains.