Mahsa Beigrezaei - Department of Computer and Information Technology, Qazvin Branch, Islamic Azad University, Qazvin, Iran
Abolfazl Toroghi Haghighat - Department of Computer and Information Technology, Qazvin Branch, Islamic Azad University, Qazvin, Iran
Seyedeh Leili Mirtaheri - Computer Engineering Department, Kharazmi University, Tehran, Iran
Narges Hajizadeh Bastani - Department of Computer and Engineering, Yadegar -e- Imam Khomeini (RAH) Shahr-e-Rey Branch, Islamic Azad University, Shahr-e-Rey, Iran

Data Grid provides sharing services for very large data around the world. Data replication is one of the most effective approaches to reduce access latency and response time. In addition to the benefits, replication has costs such as storage and bandwidth consumption, especially when storage space is low and limited. Therefore,  the data replacement should be done wisely. In this paper, we proposed a replacement method called FRA. The algorithm defines a weight for each replica that represents its value. This algorithm uses this weight to prevent the removal of valuable replicas. The results demonstrated that FRA algorithm has better performance than other replication methods in terms of the number of replications, the percentage of storage used, and the job execution time.

Data Grid, Data Replication, replica replacement