Novel algorithm for distributed replicas management based on dynamic programming

1 .INTRODUCTIONCreating replica in different nodes is a popularmethod to make sure the data reliability in distrib-uted system. On one hand, multi-replica can avoidthe single-point-of-default problem; on the otherhand ,replicas in different nodes can reduce the ac-cessing delay and prevent the hot spots problem[1](when a single fileis accessedfrequently ,the nodewill become the bottleneck of the whole system) .However , with replicas increasing, the ex-pense for maintaining replicas is bec…

Novel algorithm for distributed replicas management based on dynamic programming

Replicas can improve the data reliability in distributed system. However, the traditional algorithms for replica management are based on the assumption that all replicas have the uniform reliability, which is inaccurate in some actual systems. To address such problem, a novel algorithm is proposed based on dynamic programming to manage the number and distribution of replicas in different nodes. By using Markov model, replicas management is organized as a multi-phase process, and the recursion equations are provided. In this algorithm, the heterogeneity of nodes, the expense for maintaining replicas and the engaged space have been considered. Under these restricted conditions, this algorithm realizes high data reliability in a distributed system. The results of case analysis prove the feasibility of the algorithm.