A dynamic weighted data replication strategy in data grids

Authors:
Ruay-Shiung Chang; Hui-Ping Chang; Yun-Ting Wang
Affiliations:
Department of Computer Science and Information Engineering, National Dong Hwa University, Shoufeng, Hualien 974, Taiwan;Department of Computer Science and Information Engineering, National Dong Hwa University, Shoufeng, Hualien 974, Taiwan;Department of Computer Science and Information Engineering, National Dong Hwa University, Shoufeng, Hualien 974, Taiwan
Venue:
AICCSA '08 Proceedings of the 2008 IEEE/ACS International Conference on Computer Systems and Applications
Year:
2008

Citing 0
Cited 7

Branch replication scheme: A new model for data replication in large scale data grids

Future Generation Computer Systems
Enhanced Fast Spread Replication strategy for Data Grid

Journal of Network and Computer Applications
A survey of dynamic replication strategies for improving data availability in data grids

Future Generation Computer Systems
Parallel and multi-wavelength downloading in optical grid networks

Photonic Network Communications
A threshold-based dynamic data replication strategy

The Journal of Supercomputing
A Decentralized Periodic Replication Strategy Based on Knapsack Problem

GRID '12 Proceedings of the 2012 ACM/IEEE 13th International Conference on Grid Computing
Dynamic replica placement and selection strategies in data grids- A comprehensive survey

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data grids deal with a huge amount of data regularly. It is a fundamental challenge to ensure efficient accesses to such widely distributed data sets. Creating replicas to a suitable site by data replication strategy can increase the system performance. It shortens the data access time and reduces bandwidth consumption. In this paper, a dynamic data replication mechanism is proposed, which is called Latest Access Largest Weight (LALW). LALW selects a popular file for replication and calculates a suitable number of copies and grid sites for replication. By setting a different weight for each data access record, the importance of each record is differentiated. The data access records in the nearer past have higher weight. It indicates that these records have higher value of references. In other words, the data access records in the long past have lower reference values. A Grid simulator OptorSim is used to evaluate the performance of this dynamic replication strategy. The simulation results show that LAHW successfully increases the effective network usage. It means that the LALW replication strategy can find out a popular file and replicates it to a suitable site.