Dynamic Data Replication and Placement Strategy in Geographically Distributed data centers - Mines Paris Accéder directement au contenu
Article Dans Une Revue Concurrency and Computation: Practice and Experience Année : 2022

Dynamic Data Replication and Placement Strategy in Geographically Distributed data centers


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, the execution time of a task might be influenced by the cost of data transfers, which mainly depends on two criterias. The first one is the initial placement of the input datasets during the build-time phase, while the second is the replication of the datasets during the runtime phase. The replication is explicitly considered when datasets are being migrated over the data centers in order to make them locally available wherever needed. Data placement and data replication are important challenges in Cloud Computing. Nevertheless, many studies focus on data placement or data replication exclusively. In this paper, a combination of a data placement strategy followed by a dynamic data replication management strategy is proposed, with the purpose of reducing the associated cost of all data transfers between the (distant) data centers. Our proposed data placement approach considers the main characteristics of a data center such as storage capacity and read/write speeds to efficiently store the datasets, while our dynamic data replication management approach considers three parameters: the number of replicas in the system, the dependency between datasets and tasks and the storage capacity of data centers. The decision of when and whether to keep or to delete replicas is determined by the fulfillment of those three parameters. Our approach estimates the total execution time of the tasks as well as the monetary cost, considering the data transfers activity. Our experiments are conducted using Cloudsim simulator. The obtained results show that our proposed strategies produce an efficient data management by reducing the overheads of the data transfers, compared to both a data placement without replication (by 76%) and the selected data replication approach from Kouidri et al. (by 52%), and by improving the financial cost.
Fichier principal
Vignette du fichier
A-782.pdf (434.57 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03565161 , version 1 (10-02-2022)



Laila Bouhouch, Claude Tadonki, Mostapha Zbakh. Dynamic Data Replication and Placement Strategy in Geographically Distributed data centers. Concurrency and Computation: Practice and Experience, inPress, ⟨10.1002/cpe.6858⟩. ⟨hal-03565161⟩
19 Consultations
76 Téléchargements



Gmail Facebook Twitter LinkedIn More