2022
DOI: 10.1002/cpe.6858
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic data replication and placement strategy in geographically distributed data centers

Abstract: With the evolution of geographically distributed data centers in the Cloud Computing landscape along with the amount of data being processed in these data centers, which is growing at an exponential rate, processing massive data applications become an important topic. Since a given task may require many datasets for its execution and the datasets are spread over several different data centers, finding an efficient way to manage the datasets storage across nodes of a Cloud system is a difficult problem.In fact,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 34 publications
0
5
0
Order By: Relevance
“…It is important to note that data placement and replication techniques were investigated in many papers such as [66][67][68]. These papers can not be compared to the scheduling algorithms reviewed in our related work section, but we mention them because they study the importance of data availability in the cloud computing environment.…”
Section: Our Motivationmentioning
confidence: 99%
See 3 more Smart Citations
“…It is important to note that data placement and replication techniques were investigated in many papers such as [66][67][68]. These papers can not be compared to the scheduling algorithms reviewed in our related work section, but we mention them because they study the importance of data availability in the cloud computing environment.…”
Section: Our Motivationmentioning
confidence: 99%
“…• b ij is an integer value that represents the bandwidth of the connection between machines m i and m j (MB/second). • β ij is the elementary data transfer time [68] between machines m i and m j , it is defined by:…”
Section: System Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…The node that is estimated with the smallest workload in the future is chosen to place data blocks. A dynamic data replication strategy is proposed in [20] to minimize network bandwidth consumption and latency. The authors consider a set of characteristics, such as number of replicas, dependency between datasets, and the storage capacity to decide the lifetime of a replica.…”
Section: Related Workmentioning
confidence: 99%