Efficient Algorithms For Storage Load Balancing Of Outsourced Data In Blockchain Network. (22nd February 2021)

• Record Type: Journal Article
• Authors: Liu, Tonglai; Wu, Jigang; Li, Jiaxing; Li, Jingyi; Zhang, Zikai
• Is Part Of: Computer journal. Volume 65:Number 6(2022)
• Page Start: 1512
• Page End: 1526
• Publication Date: 2021-02-22
• Subjects: blockchain -- balanced storage -- algorithm -- balanced coefficient; Computers -- Periodicals; 005.1
• DOI: 10.1093/comjnl/bxaa196
• Languages: English
• ISSNs: 0010-4620

Abstract

Abstract: Decentralized storage of data is one of the typical applications in the blockchain network. However, most of the existing works neglected the storage balancing problem in the blockchain network, which has an immediate impact on the availability and stability of the network. Therefore, this paper proposes a storage balancing problem for non-local data storage in the blockchain network and proves that the problem is non-deterministic polynomial (NP)-hard. The criterion of the storage balance is established by a balanced coefficient in the proposed scheme. A heuristic matching algorithm (HMA), a genetic algorithm (GA) and a tabu search algorithm (TSA) are customized to solve the problem of imbalanced storage formalized in this paper. Compared with our previous algorithm fast matching algorithm (FMA), experimental results demonstrate that HMA achieves better performance in terms of accuracy, computation overhead and storage overhead. Specifically, the computation overhead of HMA is lower than that of FMA by 84.45% on average, whereas the storage overhead of HMA is lower than that of FMA by 32.26% on average. By using the initial solution of HMA, TSA achieves the highest accuracy among GA, TSA and moth-flame optimization (MFO). Meanwhile, by using the initial solution of FMA, TSA achieves the highest accuracy among GA, TSA and MFO.