Abstract- Data replication is a promising technique for increasing access performance and data availability in Data Grid (DG) systems. Current work on data replication in Grid systems focuses on infrastructure for replication and mechanisms for creating or deleting replicas. The important problem of determining minimum number of replicas, as well as their locations in DG has not been well studied. In this paper, we propose an algorithm is formulated by using dynamic programming-based algorithm to find Optimal Number of Replicas (ONR) of a dataset over DG systems, such that the read cost (i.e. transferring object over the Data Grid systems to the end-user)plus the cost of storage (i.e. site building cost) is minimized. We have also proposed a sketch of the proof for our algorithm and its integrity. I
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.