Home > Research > Publications & Outputs > A Data Replication Placement Strategy for the D...

Associated organisational unit

Electronic data

  • FINAL_VERSION

    Accepted author manuscript, 3.13 MB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Text available via DOI:

View graph of relations

A Data Replication Placement Strategy for the Distributed Storage System in Cloud-Edge-Terminal Orchestrated Computing Environments

Research output: Contribution to Journal/MagazineJournal articlepeer-review

E-pub ahead of print
  • Peng Chen
  • Mengke Zheng
  • Xin Du
  • Muhammad Bilal
  • Zhihui Lu
  • Qiang Duan
  • Xiaolong Xu
Close
<mark>Journal publication date</mark>27/05/2025
<mark>Journal</mark>IEEE Internet of Things Journal
Publication StatusE-pub ahead of print
Early online date27/05/25
<mark>Original language</mark>English

Abstract

Cloud-edge-terminal orchestrated computing, as an expansion of cloud computing, has sunk resources to the edge nodes and terminal equipment, which can provide high-quality services for delay-sensitive applications and reduce the cost of network communication. Due to the high volume of data generated by Internet of Things (IoT) devices and the limited storage capacities of edge nodes, a significant number of terminal devices are now being considered for utilization as storage nodes. However, because of the heterogeneous storage capacity and reliability of these hardware devices and the different data requirements of user services, the performance and storage reliability of applications deployed in cloud-edge-terminal orchestrated computing environments have become urgent problems to be solved. Especially, for a distributed storage system in these environments, it is required to ensure reliable storage of the generated data and its’ replications. In this paper, we first implement a distributed storage system and construct a data replication placement model. Then, based on the constructed model, we formulate the data replication placement problem and design a data replication placement strategy called DRPS to solve it. The DRPS covers a ranks-based replication storage node selection algorithm and a greedy load balancing algorithm, which can select appropriate hardware devices for different data requirements of services and is implemented in the data storage system to store replications and balance loads. We design extensive experiments to verify the effectiveness of DRPS. The results indicate that the proposed strategy outperforms other state-of-the-art algorithms in terms of system delay reduction by 39.9%, an increase of 43.3% in the replication numbers, a 27.5% improvement in memory utilization, and a reduction of unreliability rate by 82.0%.