In a data grid, nodes have a limited storage space and cannot accommodate all the replicas they need. Therefore, data replication is used to copy only important replicas that may be requested in the near future. In this paper, a dynamic data replication strategy is implemented in order to increase the number of requests served locally and reduce both the total elapsed time and total bandwidth consumption. This strategy is based on Bandwidth Hierarchy based Replication (BHR) and modified BHR strategies, but superior to them. This is because of the features this strategy has. This strategy selects a region header in each region based on a modified version of closeness centrality and stores all the replicas in the data grid in the region header. Regarding the other nodes in the region, only important replicas will be copied to them based on their number of requests per mega bit (NoRpmb) that shows how much important the replica is in relation to its size.
FigueiraS. and TrieuT., Data Replication and the Storage Capacity of Data Grids, Berlin, Heidelberg: Springer-Verlag, 2008, 567–575.
2.
CameronD.G.MillarA.P.NicholsonC.Carvajal-SchiaffinoR.StockingerK. and ZiniF., Analysis of scheduling and replica optimisation strategies for data grids using Optorsim, Journal of Grid Computing2(1) (2004), 57–69.
3.
LamehamediH.SzymanskiB.ShentuZ. and DeelmanE., Data replication strategies in grid environments, in Proceedings of the Fifth International Conference on Algorithms and Architectures for Parallel Processing, Beijing, China, 2002, 378–383.
4.
RanganathanK. and FosterI., Identifying dynamic replication strategies for a high-performance data grid, in Proceedings of the Second International Workshop on Grid Computing, London, UK: Springer-Verlag, 2001, 75–86.
5.
TangM.LeeB.YeoC. and TangX., Dynamic replication algorithms for the multi-tier data grid, Future Generation Computer Systems21(5) (2005), 775–790.
6.
DongX.LiJ.WuZ.ZhangD. and XuJ., On dynamic replication strategies in data service grids, in Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing, Washington, DC, USA: IEEE Computer Society, 2008, 155–161.
7.
RasoolQ.LiJ.OrekuG. and MunirE., Fair-share replication in data grid, Information Technology Journal7(5) (2008), 776–782.
8.
ChangR. and ChangH., A dynamic data replication strategy using access-weights in data grids, The Journal of Supercomputing45(3) (2008), 277–295.
9.
ParkS.KimJ.KoY. and YoonW., Dynamic data grid replication strategy based on internet hierarchy, in Second International Workshop on Grid and Cooperative Computing, Shanghai, China, 2003, 838–846.
10.
HongL.QiX.-D.LiX.LiZ. and WangW.-X., Fast cascading replication strategy for data grid, in Proceedings of the 2008 International Conference on Computer Science and Software Engineering, Washington, DC, USA: IEEE Computer Society, 2008, 186–189.
11.
ZhaoW.XuX.XiongN. and WangZ., A weight-based dynamic replica replacement strategy in data grids, in Proceedings of the 2008 IEEE Asia-Pacific Services Computing Conference, Washington, DC, USA: IEEE Computer Society, 2008, 1544–1549.
12.
WuJ.LinY. and LiuP., Optimal replica placement in hierarchical data grids with locality assurance, Journal of Parallel and Distributed Computing68(12) (2008), 1517–1538.
13.
BsoulM.Al-KhasawnehA.AbdallahE.E. and KilaniY., Enhanced fast spread replication strategy for data grid, Journal of Network and Computer Applications34(2) (2011), 575–580.
14.
BsoulM.Al-KhasawnehA.KilaniY. and ObeidatI., A threshold-based dynamic data replication strategy, The Journal of Supercomputing60(3) (2012), 301–310.
15.
BsoulM., A framework for replication in data grid, in 8th IEEE International Conference on Networking, Sensing and Control, Delft, the Netherlands, 2011, 234–236.
16.
MansouriN. and DastghaibyfardG., A dynamic replica management strategy in data grid, Journal of Network and Computer Applications35(4) (2012), 1297–1303.
17.
MansouriN. and DastghaibyfardG., Job scheduling and dynamic data replication in data grid environment, The Journal of Supercomputing64(1) (2013), 204–225.
18.
MansouriN. and DastghaibyfardG., Enhanced dynamic hierarchical replication and weighted scheduling strategy in data grid, Journal of Parallel and Distributed Computing73(4) (2013), 534–543.
19.
MansouriN.DastghaibyfardG. and MansouriE., Combination of data replication and scheduling algorithm for improving data availability in data grids, Journal of Network and Computer Applications36(2) (2013), 711–722.
20.
PrischepaV., An efficient web caching algorithm based on LFU-K replacement policy, in Proceedings of the Spring Young Researchers Colloquium on Database and Information Systems, St. Petersburg, Russia: IEEE, 2004, 23–26.
21.
SashiK. and ThanamaniA., Dynamic replication in a data grid using a modified BHR region based algorithm, Future Generation Computer Systems27(2) (2011), 202–210.
22.
OpsahlT.AgneessensF. and SkvoretzJ., Node centrality in weighted networks: Generalizing degree and shortest paths, Social Networks32(3) (2010), 245–251.
23.
ShorfuzzamanM.GrahamP. and EskiciogluR., Adaptive popularity-driven replica placement in hierarchical data grids, The Journal of Supercomputing51(3) (2010), 374–392.
24.
BsoulM.AlsarhanA.OtoomA.F.HammadM. and Al-KhasawnehA., A dynamic replication strategy based on categorization for data grid, Multiagent and Grid Systems10(2) (2014), 109–118.
