Allocating Duplicate Copies for IoT Data in Cloud Computing Based on Harmony Search Algorithm
Younes Jahandideh, A. Mirzaei

TL;DR
This paper introduces a harmony search algorithm-based method for optimal replica allocation in IoT cloud data management, reducing access time, delay, and energy consumption.
Contribution
It presents a novel application of the harmony search algorithm to efficiently allocate data replicas in cloud environments for IoT, addressing NP-hard optimization challenges.
Findings
Significantly decreased data access time and delay.
Reduced energy consumption in cloud data management.
Outperformed other existing methods in experiments.
Abstract
The Internet of things (IoT) generates a plethora of data nowadays, and cloud computing has been introduced as an efficient solution to IoT data management. A cloud resource administrator usually adopts the replication strategy to guarantee the reliability of IoT data. This mechanism can significantly reduce data access time, and evidently, more replicas of data increase the data storage cost. Furthermore, the process of selecting mini clouds for replica allocation and sorting replicas in mini clouds is considered an NP-hard problem. Therefore, this paper proposes an approach based on the harmony search (HS) algorithm to allocate replicas to the IoT data in the cloud computing environment in order to mitigate the data access cost. The HS algorithm was employed in the proposed approach to determine the best location for data replication in the cloud computing environment. According to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsIoT and Edge/Fog Computing · Cloud Computing and Resource Management · Cloud Data Security Solutions
