INFORMATION CHANGE THE WORLD

International Journal of Modern Education and Computer Science (IJMECS)

ISSN: 2075-0161 (Print), ISSN: 2075-017X (Online)

Published By: MECS Press

IJMECS Vol.6, No.5, May. 2014

A Survey for Replica Placement Techniques in Data Grid Environment

Full Text (PDF, 332KB), PP.46-51


Views:75   Downloads:3

Author(s)

Alireza Souri, Amir masoud Rahmani

Index Terms

Dynamic Replication;Replica Placement;Data Grid

Abstract

In data grids, data replication on variant nodes can change some problems such as response time and availability. Also, in data replication, there are some challenges to finding the best replica efficiently in relation to performance and location of physical storage systems. In this paper, various replica placement strategies are discussed. These replica placement strategies are available in the works. Replica placement contains recognizing the best possible node to duplicate data based on network latency and user request. These strategies measure and analyze different parameters such as access cost, bandwidth consumption, scalability, execution time and storage consumption. This paper also analyses the performance of various strategies with respect to the parameters mentioned above in data grid.

Cite This Paper

Alireza Souri, Amir masoud Rahmani,"A Survey for Replica Placement Techniques in Data Grid Environment", IJMECS, vol.6, no.5, pp.46-51, 2014.DOI: 10.5815/ijmecs.2014.05.06

Reference

[1]V. Andronikou, K. Mamouras, K. Tserpes, D. Kyriazis, and T. Varvarigou, "Dynamic QoS-aware data replication in grid environments based on data “importance”," Future Generation Computer Systems, vol. 28, pp. 544-553, 3// 2012.

[2]A. Souri and N. Jafari Navimipour, "Behavioral modeling and formal verification of a resource discovery approach in Grid computing," Expert Systems with Applications, vol. 41, pp. 3831-3849, 6/15/ 2014.

[3]S. Vazhkudai, S. Tuecke, and I. Foster, "Replica selection in the Globus Data Grid," in Cluster Computing and the Grid, 2001. Proceedings. First IEEE/ACM International Symposium on, 2001, pp. 106-113.

[4]K. Ranganathan and I. Foster, "Identifying Dynamic Replication Strategies for a High-Performance Data Grid," in Grid Computing — GRID 2001. vol. 2242, C. Lee, Ed., ed: Springer Berlin Heidelberg, 2001, pp. 75-86.

[5]D.-w. Chen, S.-t. Zhou, X.-y. Ren, and Q. Kong, "Method for replica creation in data grids based on complex networks," The Journal of China Universities of Posts and Telecommunications, vol. 17, pp. 110-115, 8// 2010.

[6]T. Manghui, L. Peng, I. L. Yen, B. Thuraisingham, and L. Khan, "Secure Data Objects Replication in Data Grid," Dependable and Secure Computing, IEEE Transactions on, vol. 7, pp. 50-64, 2010.

[7]R.-S. Chang, J.-S. Chang, and S.-Y. Lin, "Job scheduling and data replication on data grids," Future Generation Computer Systems, vol. 23, pp. 846-860, 8// 2007.

[8]Z. Hai, Z. Zehua, and Z. Xuejie, "A Dynamic Replica Management Strategy Based on Data Grid," in Grid and Cooperative Computing (GCC), 2010 9th International Conference on, 2010, pp. 18-23.

[9]K. Sashi and A. S. Thanamani, "Dynamic replication in a data grid using a Modified BHR Region Based Algorithm," Future Generation Computer Systems, vol. 27, pp. 202-210, 2// 2011.

[10]N. Mansouri and G. H. Dastghaibyfard, "A dynamic replica management strategy in data grid," Journal of Network and Computer Applications, vol. 35, pp. 1297-1303, 7// 2012.

[11]S.-M. Park, J.-H. Kim, Y.-B. Ko, and W.-S. Yoon, "Dynamic Data Grid Replication Strategy Based on Internet Hierarchy," in Grid and Cooperative Computing. vol. 3033, M. Li, X.-H. Sun, Q. Deng, and J. Ni, Eds., ed: Springer Berlin Heidelberg, 2004, pp. 838-846.

[12]Z. Challal and T. Bouabana-Tebibel, "A priori replica placement strategy in data grid," in Machine and Web Intelligence (ICMWI), 2010 International Conference on, 2010, pp. 402-406.

[13]A. Chervenak, E. Deelman, I. Foster, L. Guy, W. Hoschek, A. Iamnitchi, et al., "Giggle: A Framework for Constructing Scalable Replica Location Services," in Supercomputing, ACM/IEEE 2002 Conference, 2002, pp. 58-58.

[14]O. Tatebe, Y. Morita, S. Matsuoka, N. Soda, and S. Sekiguchi, "Grid Datafarm Architecture for Petascale Data Intensive Computing," in Cluster Computing and the Grid, 2002. 2nd IEEE/ACM International Symposium on, 2002, pp. 102-102.

[15]N. Saadat and A. M. Rahmani, "PDDRA: A new pre-fetching based dynamic data replication algorithm in data grids," Future Generation Computer Systems, vol. 28, pp. 666-681, 4// 2012.

[16]Jos, #233, M. P, #233, rez, #233, et al., "Branch replication scheme: A new model for data replication in large scale data grids," Future Gener. Comput. Syst., vol. 26, pp. 12-20, 2010.

[17]A. Horri, R. Sepahvand, and G. Dastghaibyfard, "A hierarchical scheduling and replication strategy," Int J Comput Sci Netw Secur, vol. 8, pp. 30-35, 2008.

[18]N. Mansouri, G. H. Dastghaibyfard, and E. Mansouri, "Combination of data replication and scheduling algorithm for improving data availability in Data Grids," Journal of Network and Computer Applications, vol. 36, pp. 711-722, 3// 2013.

[19]K. Ranganathan, A. Iamnitchi, and I. Foster, "Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities," in Cluster Computing and the Grid, 2002. 2nd IEEE/ACM International Symposium on, 2002, pp. 376-376.