TY - GEN
T1 - Heuristic-based Blockchain Assignment
T2 - 19th IEEE International Symposium on Parallel and Distributed Processing with Applications, 11th IEEE International Conference on Big Data and Cloud Computing, 14th IEEE International Conference on Social Computing and Networking and 11th IEEE International Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2021
AU - Chen, Jianyu
AU - Gai, Keke
AU - Jiang, Peng
AU - Zhu, Liehuang
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
N2 - 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.
AB - 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.
KW - Block assignment
KW - Blockchain
KW - Heuristic
KW - Optimization
UR - http://www.scopus.com/inward/record.url?scp=85124148160&partnerID=8YFLogxK
U2 - 10.1109/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00129
DO - 10.1109/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00129
M3 - Conference contribution
AN - SCOPUS:85124148160
T3 - 19th IEEE International Symposium on Parallel and Distributed Processing with Applications, 11th IEEE International Conference on Big Data and Cloud Computing, 14th IEEE International Conference on Social Computing and Networking and 11th IEEE International Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2021
SP - 916
EP - 923
BT - 19th IEEE International Symposium on Parallel and Distributed Processing with Applications, 11th IEEE International Conference on Big Data and Cloud Computing, 14th IEEE International Conference on Social Computing and Networking and 11th IEEE International Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2021
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 30 September 2021 through 3 October 2021
ER -
