DOI: 10.1007/978-3-540-72909-9_12
|View full text |Cite
|
Sign up to set email alerts
|

A Comparative Study of Replica Placement Strategies in Data Grids

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(8 citation statements)
references
References 9 publications
0
7
0
Order By: Relevance
“…We evaluate different replication methods using CloudSim [71]. In our case, there are 10 data centers and 10 different files with each size in the range of [1][2][3][4][5][6][7][8][9][10] GB. Table 14 shows the simulation parameter values.…”
Section: Evaluation Of Pif-bat Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…We evaluate different replication methods using CloudSim [71]. In our case, there are 10 data centers and 10 different files with each size in the range of [1][2][3][4][5][6][7][8][9][10] GB. Table 14 shows the simulation parameter values.…”
Section: Evaluation Of Pif-bat Algorithmmentioning
confidence: 99%
“…The popularity of data shows how much that data is requested by the system sites. In distributed systems, data popularity is applied as a key factor at different processes, namely replication decision [4], replica selection [5], replica placement [6], replica replacement [7], load balancing techniques [8], consistency maintenance [9][10], update propagation approaches [11], etc. For example, determining the number of replicas and storing them based on the popularity prevents of overloaded sites with jobs requesting popular files they contain, while other sites are idle since having unpopular files.…”
Section: Introductionmentioning
confidence: 99%
“…In this section we present an overview of major grid topologies. The performance of replication strategies is highly dependent on the underlying architecture of grid [13].Graph and tree models are used where there is a single source for data and the data has to be distributed among collaborations worldwide [13]. The Figure 1 and Figure 2, shows the Graph and tree models respectively.…”
Section: Grid Topologiesmentioning
confidence: 99%
“…The tree structure of the grid means that there are specific paths to the messages and files can travel to get to the destination. Furthermore, data transference is not possible among sibling nodes or nodes situated on the same tier [13]. Peer to Peer (P2P) systems overcome these limitations and offer flexibility in communication among components.…”
Section: Grid Topologiesmentioning
confidence: 99%
“…In recent years, more and more works focused on the replica placement in data grids (Benoit et al, 2008;Grace and and Manimegalai, 2014;Hamrouni et al, 2015b). This problem was considered as a complex optimisation problem (Challal and Tebibel, 2010), and several strategies and heuristics are proposed in the literature in order to solve it (Caron et al, 2007;Rasool et al, 2007). Indeed, there is no polynomial time algorithm for the problem that yields to an optimal solution, i.e., an optimal placement of replicas will always lead to exponential time algorithms (Thara et al, 2013).…”
Section: Introduction and Motivationsmentioning
confidence: 99%