Abstract Data gridisaninfrastructurebuilt based on internetwhichfacilitates sharing and management ofgeographically distributed data resources.Data sharing in data grids is enhanced through dynamic data replication methodologies to reduce access latencies and bandwidthconsumption.Replica placement isto create and place duplicate copies of the most needed file in beneficial locations in the data grid network. To reduce themake spani.e.,totaljob execution time, storage consumption andEffective Network Usage (ENU)in data grids, a new method for replica placement is introduced.In thisproposed method, all the nodes in thesame regionare grouped togetherand replica is placed in the highest degree and highest frequency node in the region.The node to place replica should beload balanced in terms of access and storage.The proposeddynamic Replica Placement algorithm with Load Balancing(RPLB)is tested usingOptorSimsimulator,which isdeveloped by European Data Grid Projects.In this paper,two variants of the proposed algorithm RPLB,namely RPLBfrequencyand RPLBdegreeare also presented.The comparative analysis of all the threeproposedalgorithmsisalsopresentedin this paper.A Graphical User Interface(GUI)is designedas an interface to OptorSimto get allvaluesfor grid configuration file,job configurationfile and parameters configuration file.Simulationresultsrevealthattheperformance oftheproposed methodologyisbetter in terms ofmakespan,storage consumption andreplicationcount when compared totheexisting algorithms intheliterature.

References

[1]Abawajy J., Placement of File Replicas in Data Grid inProceedings of the4th International Conference on Cognitive Systems, New Delhi,pp. 66-73,2004.

[2]Allcock W., Bester J., Bresnahan, J., Chervenak A., Foster I., Kesselman C., Meder S., Nefedova RPLB: A Replica Placement Algorithm inData Grid with Load Balancing641 V.,Quesna D.,and Tuecke S., Data Management and Transfer in High Performance Computational Grid Parallel Computing Journal, vol. 28, no. 3,pp.749-771, 2002.

[3]Allcock W., BesterJ.,Bresnahan J., Chervenak A., Foster I., Kesselman C., Meder S., Nefedova V. Quesnel D.,and Tuecke S., Secure, Efficient Data Transport and Replica Management for High-Performance Data-Intensive available at: https://arxiv.org/ftp/cs/papers/ 0103/0103022.pdf,last visited2001.

[4]Amjad T., Sher M.,and Daud A., A Survey of Dynamic Replication Strategies for Improving Data Availability in Data Grids,Future Generation Computer Systems, vol. 28,no. 2,pp. 337-349, 2012.

[5]Articulation Points Detection Algorithm., available at: http://www.ibluemojo.com/school/ articul_algorithm.html, last visited 2012.

[6]Bell W., Cameron D., Capozza L., Millar A., Stockinger K.,and Zini F., OptorSim-aGrid SimulatorforStudying Dynamic Data Replication Strategiesavailable at: https://dcameron.web.cern.ch/dcameron/talks/Op torSimIJHPCA2003.pdf,last visited2003.

[7]Cameron D., Millar A.,and Nicholson C., OptorSim: A Simulation Tool for Scheduling and Replica Optimization in Data available at:http://vis.lbl.gov/~kurts/research /OptorSimCHEP2004.pdf,last visited2004.

[8]Cibej U., Slivnik B.,and Robic B., The Complexity of Static Data Replication in Data Grids,Parallel Computing, vol. 31, no. 8, pp. 900-912, 2005.

[9]Chang R. and Chang H., A Dynamic Data Replication Strategy Using Access-Weight in Journal ofSupercomputing, vol. 45, no. 3,pp. 277-295, 2008.

[10]Chen D., Zhou S.,Ren X.,and Kong Q., Methods for Replica Creation in Data Grids using Complex Network,the Journal of China Universities of Posts and Telecommunications, vol. 17, no. 4, pp. 110-115, 2010.

[11]Chervenak A., Deelman E., Foster I., Guy L., Hoschek W., Iamnitchi A., Kesselman C., Kunst P., Ripeanu M., Schwartzkopf B., Stockinger H., Stockinger B.,and Tierney B., Giggle: A Framework for Constructing Scalable Replica Location inProceedings of ACM/IEEE 2002 Conference on Supercomputing,pp. 58, 2002.

[12]Chervenak A., Foster I., Kesselman C., Salisbury C.,and Tuecke S., The data Grid: Towards Architecture for the Distributed Management and Analysis of Large Scientific Journal of Network and Computer Applications, vol. 23, no. 3,pp.187-200, 2001.

[13]ChervenakA., Schuler R., Kesselman C., Koranda S.,and Moe B., Wide Area Data Replication for Scientific in Proceedings ofthe6thIEEE/ACM International Workshop on Grid Computing,Seattle,2005.

[14]Chervenak A., Schuler R., Ripeanu M., Amer M. A, Bharathi S., Foster I., and Kesselman C., The Globus Replica Location Service: Design and IEEE Transaction on Parallel and Distributed Systems, vol. 20, no. 9, pp. 1260- 1272, 2009.

[15]Foster I. and Kesselman C.,The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufmann, 1999.

[16]Garmehi M. andMansouriY., Optimal Placement Replication on Data Grid Environments,in Proceedings of the10th International Conference on Information Technology,pp. 190-195, 2007.

[17]Hanandeh F., Khazaaleh M., Ibrahim H.,and Latip R., CFS: A New Dynamic Replication Strategy for Data Grids,TheInternational Arab Journal of Information Technology, vol. 9, no. 1, pp. 94-99,2012.

[18]HongL., Xue-dong Q.,XiaL.,ZhenL.,and Wen-xingW., Fast Cascading Replication Strategy for Data inProceedings of International Conference on Computer Science and Software Engineering,Wuhan,pp. 186-189, 2008.

[19]Horri A., SepahvandR.,andDastghaibyfard H., A Hierarchical Scheduling and Replication InternationalJournal ofComputer Science and Network Security, vol. 8, no. 8, pp. 30-35, 2008.

[20]Human Genome Project., available at: http://www.nhgri.nih.gov/, last visited 2013.

[21]Human Brain Project., available at:http://www- hbp.scripps.edu, last visited 2013.

[22]Kingsy G.and Manimegalai R., Dynamic Replica Placement and Selection Strategies in Data Grids-A comprJournalof Parallel and Distributed Computing, vol. 74, no. 2, pp. 2099-2108, 2014.

[23]Lamehamedi H., Shentu Z., Szymanski B. and Deelman E., Simulation of Dynamic Data Replication Strategies in Data in Proceedings of the 17thInternational Parallel andDistributed Symposium,pp.100-102, 2003.

[24]Lee M., Leu F.,andChen Y., PFRF: An Adaptive Data Replication Algorithm Based on Star Topology Data Future Generation Computer Systems, vol. 28, no. 7, pp. 1045-1057. 2011.

[25]Mansouri N. and Dastghaibyfard G., A Dynamic Replica Management strategy in Data Journal of Networkand Computer Applications, vol. 35,no. 4,pp. 1297-1303, 2012. 642The International Arab Journal of Information Technology, Vol. 13, No. 6, November 2016

[26]Mansouri N., Dastghaibyfard G.,and Mansouri E., Combination of Data Replication and Scheduling Algorithm for Improving Data Availability in Data Journal of Network and Computer Applications, vol. 36,no. 2,pp. 711-722, 2013.

[27]Mansouri N., Dastghaibyfard G.,and Mansouri E., Enhanced Dynamic Hierarchical Replication and Weighted Scheduling Strategy in Data Grid, Journal of Parallel Distributed Computing, vol. 73,no. 4,pp.534-543, 2013.

[28]Meroufel B.and Belalem G., Managing Data Replication and Placement Based on AASRI Conference on Parallel and Distributed Computing Systems, AASRI Procedia, pp.147-155, 2013.

[29]Nukarapu D.,Tang B.,Wang L.,and Lu S., Data Replication in Data Intensive Scientific Applications with Performance IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 8, pp. 1299-1306, 2011.

[30]Park S., Kim J.,Ko Y., and Yoon W., Dynamic Data Replication Strategy Based on Internet Hierarchy BHR,available at: https://pdfs.semanticscholar.org/6b32/05fc21cba 61f5aec0a0321f4095b85e420c0.pdf,last visited 2004.

[31]Rahman M., Barker K.,and AlhajjR., Replica Placement Strategies in Data Journal of Grid Computing, vol. 6, pp.103-123, 2008.

[32]Ranganathan K. and Foster I., Identifying Dynamic Replication Strategies for aHigh Performance of Data inProceedings of the 2ndinternational workshop on Grid Computing, Berlin, pp. 75-86, 2005.

[33]Rehn J.BarrassT.,BonacorsiD., andWuY., Phedex: High-Throughput Data Transfer Management inProceedingsof Computing in High Energy and Nuclear Physics, 2006.

[34]Rasool Q., Li J., Oresu G.,and Munir E., Fair- Share Replication in Data Information Technology Journal, vol. 7, no. 5, pp. 776-782, 2008.

[35]Sashi K. and Thanamani A., Dynamic Replication in a Data Grid using Modi ed BHR Region Based Algorithm,Future Generation Computer Systems, vol. 27, no. 2, pp. 202-210, 2011.

[36]Shorfuzzaman M., Graham P. and Eskicioglu R., Distributed Popularity Based Replica Placement in Data Grid in Proceedings of International Conference on Parallel and Distributed Computing, Applications and Technologies,Wuhan,pp. 66-77, 2010.

[37]Tang M., Lee B., and Yeo C., Dynamic Replication Algorithm for the Multi-tierData Grid,Future Generation computersystems, vol. 21, no.5, pp. 775-790, 2005.

[38]Tatebe O., Morita Y., Matsuoka S., Soda N. and Sekiguchi S., Grid Datafarm Architecture for Petascale Data Intensive in Proceedings of2ndIEEE/ACM International Symposium onCluster Computing and the Grid, pp. 102, 2002.

[39]The Large Hadron Collider (LHC).,available at: http://public.web.cern.ch/Public/en/LHC/LHC- en.html,last visited2012.

[40]The Earth System Grid Project.,available at: http://www.earthsystemgrid.org/, last visited 2013.

[41]Thomas H.,Charles E.,Leiserson, Ronald L. Rivest, Clifford Stein,Introduction to Algorithms,MIT Press Cambridge,2001.

[42]Thuy N., Anh T., Thanh D., Tung D., Kien N., and Giang T., Construction of a Data Grid for Meteorology in Vietnam,inProceedings of International Conference on Grid Computing andApplications,pp. 186-191, 2007.

[43]Viger F. and Latapy M., Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree in proceedings of the 11thConference of Computing andCombinatoric,pp 440-449, 2005..

[44]Xiong F., Xin-xin Z., Jing-yu H.,and Ru-chuan W., QoS-aware Replica Placement for Data Intensive the Journal of China Universities of Posts and Telecommunications, vol. 20, no. 3, pp. 43-47, 2013.

[45]Yuan Y., Wu Y., Yang G.,and Yu F., Dynamic Data Replication Based on Local Optimization Principle in Data Grid,In Proceedings of GCC, pp. 815-22, 2007.

[46]Zaman S. and Grosu D., A Distributed Algorithm forthe Replica Placement IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 9, pp. 1455-1468, 2011. KingsyRajaretnamhas graduated in Computer Science and Engineering from Noorul Islam College of Engineering, India, in 2003 and completed her M.E. Computer Science and Engineering in 2005 from Karunya Institute of Technology, India. Currently she is pursuing her Ph.D at Anna University, Chennai, India. Her areas of interest include Grid Computing and Cloud Computing. Her research focus is on Dynamic replica placement and selection strategies in data grid. She has about 10 years of teaching experience. She is currently working as an Assistant Professor in CSE, Sri Ramakrishna Engineering College, Coimbatore, India. She is life member of ISTE. RPLB: A Replica Placement Algorithm inData Grid with Load Balancing643 ManimegalaiRajkumar hasgraduated from PSG College of Technologyin Computer Science and Engineering.Sheisalsoan alumnusofCollege ofEngineering Guindy,Anna University and IIT Madraswhere she has done her Master sandDoctoraterespectively.She has more than twenty years ofexperience in teaching, research and industry put-together. Currently she is working as a Professor and Research Directorwith Park College of Engineering and Technology, Coimbatore, India.She holds life membership in CSI, IE (India) and ISTE. She is also a member of IEEE and VLSI society of India. Her areas of interest include Reconfigurable Computing,VLSI/FPGA Algorithms, Distributed Systems and Cloud Computing.She has widely published in journals and conferences and is guiding several PhD research scholars. RanjithVenkatesanhas completed his BEdegreein Computer Science and Engineering at Sri Ramakrishna Engineering College, Coimbatore in 2013.Currently, heis working as Member Technical Staff in Zoho Corporation, Chennai, India. His areas of interestsinclude gridcomputing, cloud computing and data base management systems.