A novel replica placement algorithm for minimising communication cost in distributed storage platform

In large-scale distributed systems, replication service has been playing a critical role to improve the availability and reliability of user data. Conventionally, the existing replication services mainly concentrate on how many replicas are needed to maintain desirable availability and reliability rather than how to place replicas on the most suitable storage nodes. As a result, the communication-related costs when accessing data are significantly increased, which in turn degrades the execution performance of user applications. In this paper, we propose a novel replica placement algorithm which is designed to minimise the communication cost when accessing or managing replicas in a large-scale storage platform. In the proposed algorithm, the replica placement problem is formulised a classical multi-knapsack problem, and two heuristic metrics are introduced to obtain the sub-optimal solution of this problem. A lot of experiments are conducted to investigate the performance of the proposed algorithm. The experimental results indicate that our replica placement algorithm outperforms many existing approaches in terms of different performance metrics. In addition, the proposed algorithm can also significantly improve the execution efficiency for data-intensive applications, which are very common in nowadays large-scale distributed systems, such as grid and cloud. © 2020 Inderscience Enterprises Ltd.