A Novel Dynamic Replication Algorithm in Hierarchical Data Grid

Abstract

Data grid provides massive aggregated computing resources and distributed storage space to deal with data-intensive applications. Due to limitation of available resources in grid as well as production the large number of workloads, efficient use of the grid resources becomes important challenge. Replication provides decreased bandwidth consumption, improved fault tolerance, and enhanced scalability. Although replication is a key technique, but the problem of selecting proper locations for placing replicas i.e. best replica placement in Data Grid has not been widely studied, yet. In this paper a modified three-layer hierarchical replication algorithm is proposed for dynamic creation of replicas, replica selection and especially replica placement which selects best location. The simulation and experiment results show the proposed replication strategy outperforms over current strategies about 14%. contain at least 70 and at most 150 words. It should be set in nine-point font size and should be inset 1.0 cm from the right and left margins. There should be two blank (10-point) lines before and after the abstract. This document is in the required format.