Replica Placement in Multi-tier Data Grid

A dynamic, cost-aware, optimized data replication strategy for heterogeneous cloud data centers

“…In [21], another replication strategy has been proposed, in which the data file request from child can be satisfied not only by its parents, but also from its siblings. In this, the multi-tier siblingtree architecture is used.…”

“…Two different replication strategies are in widespread use: static replication [11][12][13] and dynamic replication [14][15][16][17][18][19][20][21][22][23][24][25][26][27]. Based on these two strategies, different replication algorithms and schemes have been proposed by different researchers.…”

Data replication strategies with performance objective in data grid systems: a survey

“…It consists of storing multiple copies of data, called replicas, at multiple nodes (Bernstein et al, 1987). Data replication has been commonly used in: (a) Database Management Systems (DBMS) (Perez et al, 2010), (b) parallel and distributed systems (Loukopoulos et al, 2005;Benoit and Rehn-Sonigo, 2008), (c) mobile systems (Tu et al, 2006) and (d) large-scale systems including P2P (Goel and Buyya, 2006;Xhafa et al, 2012a) and data grid systems (Ranganathan and Foster, 2001;Chervenak et al, 2002;Bell et al, 2003a;Lamehamedi et al, 2003;Abawajy, 2004;Park et al, 2004;Chang et al, 2006;Rahman et al, 2008;Rasool et al, 2009;Sashi and Thanamani, 2011;Abdullah et al, 2012;Mansouri and Dastghaibyfard, 2012;Devakirubai and Kannammal, 2013). In DBMS and distributed systems, replication designers pay attention to manage updates as well as performance of read-only queries.…”

A GA-Based Replica Placement Mechanism for Data Grid

“…The idea behind PBRP is to place replicas as close as possible to those clients that frequently request data files. Further work by [30] presented a dynamic replica placement in multi-tier Data Grid that categorized the files based on their access frequency into two groups: 1) Most Frequent Files (MFF) that are replicated and placed at the parent node of their respective best clients, where the best client for a file is a client which generates the maximum request for that file, and 2) Least Frequent Files (LFF) that are placed at one tier below the root of the Data Grid along the path of their best client. In [31], a dynamic placement algorithm was proposed that takes into account the dynamicity of sites in the Data Grid, since a site can at any time leave the grid and possibly join again later.…”