Open Access
ARTICLE
Efficient Heuristic Replication Techniques for High Data Availability in Cloud
1
Department of Computer Science and Engineering, School of Engineering, Presidency University, India
2
Department of Computer Science and Engineering, HKBK College of Engineering, India
* Corresponding Author: H. L. Chandrakala. Email: ,
Computer Systems Science and Engineering 2023, 45(3), 3151-3164. https://doi.org/10.32604/csse.2022.027873
Received 27 January 2022; Accepted 10 April 2022; Issue published 21 December 2022
Abstract
Most social networks allow connections amongst many people based on shared interests. Social networks have to offer shared data like videos, photos with minimum latency to the group, which could be challenging as the storage cost has to be minimized and hence entire data replication is not a solution. The replication of data across a network of read-intensive can potentially lead to increased savings in cost and energy and reduce the end-user’s response time. Though simple and adaptive replication strategies exist, the solution is non-deterministic; the replicas of the data need to be optimized to the data usability, performance, and stability of the application systems. To resolve the non-deterministic issue of replication, metaheuristics are applied. In this work, Harmony Search and Tabu Search algorithms are used optimizing the replication process. A novel Harmony-Tabu search is proposed for effective placement and replication of data. Experiments on large datasets show the effectiveness of the proposed technique. It is seen that the bandwidth saving for proposed harmony-Tabu replication performs better in the range of 3.57% to 18.18% for varying number of cloud datacenters when compared to simple replication, Tabu replication and Harmony replication algorithm.Keywords
Cite This Article
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.