A Round-based Data Replication Strategy

Data Grid allows many organizations to share data across large geographical area. The idea behind data replication is to store copies of the same file at different locations. Therefore, if a copy at a location is lost or not available, it can be brought from another location. Additionally, data replication results in a reduced time and bandwidth because of bringing the file from a closer location. However, the files that need to be replicated have to be selected wisely. In this paper, a round-based data replication strategy is proposed to select the most appropriate files for replication at the end of each round based on a number of factors. The proposed strategy is based on Popular File Replicate First (PFRF) strategy, and it overcomes the drawbacks of PFRF. The simulation results show that the proposed strategy yields better performance in terms of average file delay per request, average file bandwidth consumption per request, and percentage of files found.

[1]  Antony Selvadoss Thanamani,et al.  Dynamic replication in a data grid using a Modified BHR Region Based Algorithm , 2011, Future Gener. Comput. Syst..

[2]  Ruay-Shiung Chang,et al.  A dynamic data replication strategy using access-weights in data grids , 2008, The Journal of Supercomputing.

[3]  Won-Sik Yoon,et al.  Dynamic Data Grid Replication Strategy Based on Internet Hierarchy , 2003, GCC.

[4]  Kavitha Ranganathan,et al.  Identifying Dynamic Replication Strategies for a High-Performance Data Grid , 2001, GRID.

[5]  Yi-Fang Lin,et al.  Optimal replica placement in hierarchical Data Grids with locality assurance , 2008, J. Parallel Distributed Comput..

[6]  Lada A. Adamic,et al.  Zipf's law and the Internet , 2002, Glottometrics.

[7]  Fang-Yie Leu,et al.  PFRF: An adaptive data replication algorithm based on star-topology data grids , 2012, Future Gener. Comput. Syst..

[8]  Yousef Kilani,et al.  A threshold-based dynamic data replication strategy , 2010, The Journal of Supercomputing.

[9]  Floriano Zini,et al.  Analysis of Scheduling and Replica Optimisation Strategies for Data Grids Using OptorSim , 2004, Journal of Grid Computing.

[10]  Gholamhossein Dastghaibyfard,et al.  A dynamic replica management strategy in data grid , 2012, J. Netw. Comput. Appl..

[11]  Ming Tang,et al.  Dynamic replication algorithms for the multi-tier Data Grid , 2005, Future Gener. Comput. Syst..

[12]  Silvia Figueira,et al.  Data Replication and the Storage Capacity of Data Grids , 2008, VECPAR.

[13]  Mohammad Bsoul A framework for replication in Data Grid , 2011, 2011 International Conference on Networking, Sensing and Control.

[14]  Naixue Xiong,et al.  A novel dynamic network data replication scheme based on historical access record and proactive deletion , 2012, The Journal of Supercomputing.

[15]  Peter C. J. Graham,et al.  Adaptive popularity-driven replica placement in hierarchical data grids , 2010, The Journal of Supercomputing.

[16]  Yousef Kilani,et al.  Enhanced Fast Spread Replication strategy for Data Grid , 2011, J. Netw. Comput. Appl..

[17]  Mohammad Bsoul,et al.  A dynamic replication strategy based on categorization for Data Grid , 2014, Multiagent Grid Syst..

[18]  E. Deelman,et al.  Data replication strategies in grid environments , 2002, Fifth International Conference on Algorithms and Architectures for Parallel Processing, 2002. Proceedings..

[19]  Jianzhong Li,et al.  Fair-Share Replication in Data Grid , 2008 .