Efficient Centralized Data Replication Algorithm for Data Grids

Common problems in the DataGrids are: ensuring availability, minimizing access cost and larger file transfer time. The appropriate solution to these problems is Data Replication. The data files are replicated onto the grid sites and hence the availability is increased. There is no need for transferring files as the nearest replica sites can be used up when data files are needed. The problem of data replication has been proven to be non-deterministic and NP-hard i.e., they cannot be solved in polynomial time. All these problems´ solutions in previous research do have theoretical guarantee without practical consideration. To overcome this, an Efficient Centralized Data Replication Algorithm is proposed in this paper. It is a polynomial time replication algorithm that replicates the data files onto the grid such that the reduction of total access cost of the data files in the grid is maximized. This algorithm is to be simulated in GridSim. The wide spread nature of the data usage and the increased era of data rich applications play a major role for the motivation of this work.