Heuristic-based Blockchain Assignment: An Empirical Study
Jianyu Chen, Keke Gai, Peng Jiang, Liehuang Zhu · 2021
The power of blockchain is compromised with the rapid growth of blockchain size, which puts a heavy storage burden on each node in the blockchain system due to the limited capacity. A mainstream technology to overcome the scalability limitations is to combine sharding with the multiple-replication mechanism to split the storage overhead among nodes. However, the computation complexity for generating block allocation strategy will be exponentially growing when both the sizes of blocks, nodes, and replications boom. In this paper, we abstract the assignment problem on blockchain as an Energy-aware Block Allocation Minimum Problem (EBAMP) and implement several heuristic algorithms, including genetic algorithms, discrete particle swarm algorithms and greedy algorithms. In order to identify similarities and differences of these algorithms, we compare and analyze different methods based on common principles.