Efficient and Scalable Dynamic Graph Replication for Cloud Computing Services

The cloud environment has garnered significant attention due to its crucial role as a supportive framework in computer science and engineering activities. This ever-growing adoption has increased among users, necessitating ongoing efforts to maintain and enhance cloud performance. A widely recognised approach to improving the user experience in cloud environments is data replication. This article proposes a Locality-Aware Dynamic Data Replication Algorithm (LADRE) designed to balance network load and enhance performance. The proposed model identifies the most appropriate data files for replication and selects optimal storage nodes for placing replicas. Simulations conducted using the CloudSim library demonstrate that LADRE improves cloud network load balancing by 5% compared to prior methods. Furthermore, LADRE outperforms existing approaches regarding network response time, storage efficiency, and the frequency of data removal operations.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Services Computing
Published
2025-01-01
DOI
https://doi.org/10.1109/tsc.2025.3570874
Primary Topic
Graph Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient and Scalable Dynamic Graph Replication for Cloud Computing Services

Amir Javadpour, Forough Ja’fari, Weizhe Zhang
IEEE Transactions on Services Computing
Graph Theory and Algorithms
article

Efficient and Scalable Dynamic Graph Replication for Cloud Computing Services

Amir Javadpour, Forough Ja’fari, Weizhe Zhang
article en

Abstract

The cloud environment has garnered significant attention due to its crucial role as a supportive framework in computer science and engineering activities. This ever-growing adoption has increased among users, necessitating ongoing efforts to maintain and enhance cloud performance. A widely recognised approach to improving the user experience in cloud environments is data replication. This article proposes a Locality-Aware Dynamic Data Replication Algorithm (LADRE) designed to balance network load and enhance performance. The proposed model identifies the most appropriate data files for replication and selects optimal storage nodes for placing replicas. Simulations conducted using the CloudSim library demonstrate that LADRE improves cloud network load balancing by 5% compared to prior methods. Furthermore, LADRE outperforms existing approaches regarding network response time, storage efficiency, and the frequency of data removal operations.

IEEE Transactions on Services Computing
Harbin Institute of Technology (CN)
Openalex Percentile: Top 91%
Graph Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.