Survey on data replication in cloud systems

2.1.1. Replication management approach

In 2016, Mansouri et al. [43] have presented a novel replica placement to provide cost-effective availability, reduce application response time, & load balance cloud storage. The replica placement was determined by five key factors: mean service time, failure probability, load fluctuation, latency, & storage use. Nevertheless, since each site’s storage capacity was restricted, replication should be handled with caution. They use the CloudSim simulator to analyze the method & discover that it outperforms existing algorithms based on mean response time, effective network utilization, load balancing, replication frequency, & storage consumption.

In 2012, Sun et al. [73] have explored a dynamic data replication approach in this study, along with a brief examination of replication strategies appropriate for distributed computing settings. It entails: 1) evaluating as well as modelling the relationship among system availability as well as the number of replicas; 2) analyzing as well as specifying popular data & triggering a replication operation whenever the popularity data reaches a dynamic threshold; 3) determining a suitable number of copies to fulfill a sensible system byte effective rate necessity as well as evenly distributing replicas among data nodes; as well as 4) developing the dynamic data replication method in the cloud. Results demonstrate that the proposed cloud technique increases the accuracy & effectiveness of the enhanced system.

In 2019, Ramanan et al. [65] have investigated the use of these data corruption like effective reliability of data replication using an SDS technique to continually fulfill the QoS constraints. When the proposed technique was compared to cost-effective dynamic data replication, it was observed that the average recovery time was reduced by 18.18% for the 250 amount of requested nodes, 11.11% for the 750 amount of requested nodes, 14.28% for the 500 quantity of suggested nodes, as well as 8.69% for the 1000 amount of requested nodes.

In 2019, Edwin et al. [13] have provided 3 different features on dynamic, cost-aware data replication methods via optimization, that determine the least quantity of data replication information necessary to ensure the data availability growth when the replication process is increased. By combining these optimization objectives, an EIMORM may solve this optimum problem. As a consequence, the simulation findings could be used to promote energy efficiency as data replication recommendations.

In 2021, Mohammad et al. [50] have suggested a CSO-based method for SDR that uses a smart fuzzy inference system with four inputs: centrality, energy, storage usage, as well as load to identify the best data center for a novel replica. In particular, a high-quality knowledge base was created to characterize the CSO method’s fuzzy system. They use the CloudSim toolkit to test the suggested algorithm, as well as the results reveal that the SDR method could decrease total energy usage and reaction time by 31% & 28% (on average) compared to other relevant algorithms.

In 2015, Boru et al. [6] has investigated data replication in cloud computing data centres. This study examines data replication in geographically dispersed cloud computing data centers & provides a new replication strategy that maximizes the system’s energy efficiency in combination with standard performance measures like network bandwidth availability. The findings of the comprehensive simulations aid in revealing performance and energy efficiency trade offs for guiding the development of future data replication systems.

In 2021, Maheshwari et al. [41] has suggested a consensus-based file replication methodology based on the message forwarding framework that tackles the previous methods’ server confidence problem. The Master–Slave protocol employs a two-layered framework that divides servers into masters and slaves. Following the suggested methodology, the updated data file would be provided instantly to the readers without any ambiguity. The protocol was conducted, as well as the experimental and theoretical results were confirmed.

In 2021, Ulabedin et al. [78] have presented a workflow scheduling strategy to resolve data transmission & complete workflow activities under tight deadlines & budgets. The suggested strategies include an initial data placement phase that clusters & distributes datasets depending on their interconnections, as well as an R-PCP methodology that organizes tasks with data locality & continuously manages the dependency matrix for the deployment of created data sets. When comparing random & ADAS approaches, R-PCP has 44.93% & 31.37% less data movement, correspondingly. When compared to the ADAS approach, R-PCP uses 26.48% less energy.

In 2013, Chen et al. [35] have suggested two QADR techniques in the cloud computing environment. The first method utilizes the HQFR concept to conduct data replication. Nevertheless, this greedy approach has been unable to reduce the cost of data replication as well as the count of data copies with QoS violations. Furthermore, a cloud computing system is known to have a huge number of sensor nodes. Furthermore, simulation tests were conducted to show that the suggested methods were successful in data replication & restoration.

In 2019, Toosi et al. [53] have developed the best offline solution based on dynamic & linear programming approaches and also the requirement of accurate workload knowledge on objects. The second online method was randomized, and it used the RHC approach to utilize future workload data for “w” time periods. Experiments employing a workload created based on features of the Facebook workload confirmed the efficacy of the suggested algorithms.

In 2021, Latip et al. [2] has proposed the VRS-BQ replica placement approach in cloud contexts to reduce storage usage, response time, & replication process time. The suggested VRS-BQ algorithm achieves a 25% reduced average response time, 22% lesser replication time, as well as 20% lower storage consumption similar to the previous DPRS algorithm while maintaining the highest level of data availability, according to extensive experiments performed by using well-known CloudSim simulation platform.

In 2021, Mseddi et al. [61] has determined a CRANE cost-effective replication migration strategy for a distributed cloud storage scheme. CRANE enhances any replica placement technique by effectively managing replica generation in geo-distributed infrastructures to (1) reduce the time it takes to copy data to a new replica site, (2) eliminate network congestion, & (3) assure the data’s current minimum availability. They further demonstrate that, when compared to OpenStack Swift, CRANE was able to cut replica generation & migration time to 60% & inter-data center network traffic to 50% while maintaining minimal data availability.

In 2021, Raouf et al. [66] has suggested a CB-MT DBMS that anticipates migration & replication choices by monitoring as well as responding before the SLA violation. In comparison to earlier methodologies, investigational results demonstrate that the proposed MTDB-MR method seems to be the best candidate for migration as well as replication of violated multi-tenant databases because it minimizes the total count of SLA violations, the amount of multi-tenant client SLA violations, client sites average response time, as well as the overall execution time of every multi-tenant client site.

In 2021, Zhang et al. [83] has determined BDS+, a near-optimal network solution for large-scale inter-DC data replication. BDS+ had been a completely centralized application-level multicast overlay network which permitted a central controller to keep track of the data delivery condition of intermediary servers throughout accessible overlay pathways. Furthermore, dynamic bandwidth separation could decrease bulk data transfer execution times by approximately 1.2 to 1.3 times.

In 2021, Awad et al. [5] has suggested two bio-inspired methods to optimize both data replica selection & placement in the clouds. MO-PSO & MO-ACO were offered as algorithms for dynamic data replication. In comparison to other methods, the simulation results show that MOPSO provides better data replication. When compared to other techniques, MOACO has greater data availability, cheaper cost, & reduced bandwidth usage.

In 2020, Amel et al. [30] have presented a unique mixture of the BVS algorithm for scheduling and the CEMR method for dynamic data replication. The goal was to increase data access efficiency while maintaining provider profit to achieve service level objectives based on reaction time SLORT & least availability SLOMA. The numerical simulations show that the suggested scheduling & replication algorithms work much better than existing solutions.

In 2019, Riad et al. [59] has presented a data replication solution within Cloud data centers that fits both the performing tenant goal as well as the provider profit goal. Data replication was performed if only: (i) the expected Response Time of Q outperforms a crucial RT threshold (per-query replication), or (ii) more frequently if RTQ surpasses another (smaller) RT threshold for a specific amount of times before the tenant query Q was executed (replication per set of queries). RSPC outperforms the other 4 techniques in terms of RT under heavy loads, complicated queries, & restrictive RT criteria. Furthermore, penalty & data transmission costs have been drastically decreased, affecting provider profit.

In 2018, Liang et al. [34] has tackled co-residence attacks, in which a malicious attacker might steal or damage a user’s sensitive information by co-residing the attacker’s VM on the same physical server as the target user’s VM. Dynamic data replication rules were investigated and optimized using the proposed evaluation methodology. The effects of different method parameters on dynamic data sustainability & security were demonstrated using numerical results.

In 2018, Mansouri et al. [46] have developed a novel dynamic replication approach known as PDR, that uses file access history to identify the correlation of data files as well as pre-fetches the most popular files. PDR delivers excellent data availability, a good hit ratio, and minimal storage & bandwidth usage, according to comprehensive CloudSim tests. As compared to other techniques, PDR decreases reaction time by an approximate average of 35%.

In 2016, Navneet et al. [19] has investigated a dynamic, cost-aware, optimal data replication technique in this research that determines the smallest number of copies needed to achieve the specified availability. The CloudSim toolbox was used to evaluate the suggested technique. The test findings show that the method was beneficial in lowering replication costs and maximizing data availability.

In 2021, Gregory et al. [33] has developed a cloud system that relies on the TRC approach to increase the likelihood of a real-time activity being completed successfully by reducing system loads & user costs. A probabilistic model for evaluating job completion possibility by a specific deadline, projected work completion duration, & data theft success probability would be included in the solution technique.

In 2020, Behnam et al. [52] have introduced a multi-objective optimized placement method on a meta-heuristic approach as well as the fuzzy system that balances the trade-offs among the six optimization objectives to discover the best places for replicas. Furthermore, comprehensive experiments using CloudSim demonstrate that the suggested replication algorithms improve the most popular replication strategies in terms of hit ratio, amount of replications, load variance, latency, average service time, availability, & energy usage.

In 2019, Gustavo et al. [27] has introduced FT-Aurora, a high-availability IaaS cloud manager which permits access to cloud resources even though the manager fails. By enabling network programmability, FT-Aurora allows for more efficient and flexible resource management. Both the efficiency & reliability of FT-Aurora were tested as well as the conclusions were given.

In 2018, Suji et al. [20] has presented an approach for dynamically adjusting the replica factor for each data item based on the data’s popularity, its present replication factor, as well as the number of active nodes in the cloud services. HDFS was used to accomplish the suggested technique. The test findings demonstrate that the suggested strategy keeps an appropriate number of clones for each data item depending on its popularity while respecting the cloud storage availability limitation.

In 2017, Kuchaki et al. [51] has developed a data replication approach based on data access behavior called the PRS on Cloud system. Depending on the 80/20 principle, DPRS duplicates just a tiny portion of frequently requested data files. Using the CloudSim simulation, they measure efficient network consumption, mean task execution time, hit ratio, the overall amount of replications, & percent of storage filled. Extensive testing has shown that DPRS was successful in the majority of access patterns.

In 2014, Sai et al. [39] has presented a multi-objective offline optimization strategy regarding replica management. MORM, the suggested method, balances the trade-offs among the 5 optimization goals to provide near-optimal alternatives. The MORM outperforms the default HDFS replication management as well as the MOE method in terms of reliability & load balancing for large-scale cloud storage clusters, according to experimental data.

In 2014, Tao et al. [11] has introduced the SSOR technology, a middleware capable of meeting the consistency needs of applications while duplicating cloud-based services. They introduce an MSP, which needs an aware version of the standard fixed sequencer technique, to handle the linked sub-problem of atomic broadcasting. Furthermore, comparing the adopted method to the traditional replication strategy and performing experiments show that the suggested technique offers superior scalability with much more adjustable consistency requirements.

In 2020, Abbes et al. [1] has discussed the issues of replication factor adaptation & presents a unique replication factor modelling strategy that uses prediction models to forecast the correct replication factor. They performed regression analysis to determine the relationship between availability as well as the number of copies. Simulations on the Grid’5000 testbed show the advantages of the concept for meeting the availability criterion by utilizing real fault-tolerant cloud infrastructure.

In 2020, He et al. [26] have developed a unique DPRS that combines file access frequency with a prediction algorithm to anticipate future file access & calculate the optional amount of replicas based on real as well as prospective access periodically. The findings of this research reveal that DPRS may significantly cut the response time of a file request, which also reduces the additional cost of cloud storage.

In 2021, Khelifa et al. [31] have suggested a new scheduling method known as BCVS, as well as a new dynamic data replication approach known as CEMR. According to test findings, the suggested mixture of scheduling & replication methods provides a 30 percent larger monetary profit for the cloud provider than conventional approaches. It also provides for improved performance.

In 2020, Javidi et al. [48] has investigated a novel dynamic replication approach dubbed DMDR, that uses the file access histories to measure the correlation of data files retrieved. They’re especially interested in how extracted information combined with maximum frequent correlated pattern mining optimizes data replication. In comparison to the present technology, numerical simulations using CloudSim show that the DMDR strategy seems to have a significant benefit in average response time, efficient network utilization, & hit ratio.

In 2014, Kumar et al. [32] has designed SWORD, a workload-aware data placement & replication technique to decrease resource use in a scenario. They demonstrate that these strategies result in a considerable decrease in total resource consumption for analytical read-only applications. They illustrate that lowering the amount of distributed transactions increases transaction latencies & total throughput for OLTP workloads.

In 2016, Galen et al. [40] has designed and developed an active machine learning system for temporal updating (or backcasting) of land cover data at 3 NLCD research sites. These findings show that the land cover data included in the NLCD may be efficiently retrieved for replication purposes utilizing only Landsat images. The system was completely automated & adaptable at numerous points in time at the landscape as well as regional sizes.

In 2015, Sreekumar et al. [79] has implemented a dynamic data replication mechanism to improve the efficiency of the software application. They evaluate the popularity degree as well as the replica factor to choose the best file to replicate as well as the appropriate number of replicas. They utilize the round-robin approach to arrange the replicas in the specified systems, but they use the fuzzy logic system for determining the system to position the replicas. They evaluate the approach’s effectiveness to traditional algorithms.

In 2016, Bui et al. [8] has created a system for dynamically replicating data files based on predictive analysis & thoughtful consideration of the HDFS replication disadvantages. After that, the popular files could be copied due to their own access capabilities. As a result, when compared to the default technique, the technique significantly enhances availability and maintains dependability. In addition, while dealing with Big Data, complexity reduction was used to improve the prediction’s efficacy.

2.1.2. Replication selection approach

In 2016, Sookhtsaraei et al. [72] have suggested the LRM, or recommended replication manager, uses two fundamental algorithms that take use of the physical adjacency property of blocks. They evaluated the method against MOE, MORG, & Hadoop in terms of replica count. For replication management, the HDFS structure was employed. A series of simulations was also published to illustrate that LRM might be a good alternative for distributed environments since it requires less energy and resources, optimizes load distribution, and also has higher availability & lower latency.

In 2019, Shen et al. [37] have introduced a PMCR technique for cloud storage with great data durability. PMCR divides the cloud storage service into a primary and backup layer, it categorises data into hot, warm, & cold categories depending on its popularity. In comparison to previous replication systems, extensive performance calculations based on trace parameters as well as actual results from real-world Amazon S3 reveal that PMCR delivers great data durability, the minimal likelihood of data loss, inexpensive storage as well as bandwidth costs.

In 2018, Bilal et al. [3] have suggested DROPS, which addresses performance and security problems jointly. Additionally, the DROPS approach for data security does not rely on existing cryptographic procedures, alleviating the platform of computationally costly methodologies. Researchers also compared the DROPS methodology’s performance to those of eleven other systems. The improved level of security has been seen with a little performance overhead.

In 2018, Mansouri et al. [46] have developed a novel dynamic replication approach known as PDR, that uses file access history to identify the correlation of data files as well as pre-fetches the most popular files. PDR delivers excellent data availability, a good hit ratio, and minimal storage & bandwidth usage, according to comprehensive CloudSim tests. As compared to other techniques, PDR decreases reaction time by an approximate average of 35%.

In 2018, Marwa et al. [56] have been intended to function primarily in a cloud-based Advanced Metering Infrastructure with 3 levels: Smart Meter, Aggregator, and Cloud. While sent from the Aggregator layer to the Cloud layer, the System greatly decreases the amount of the energy consumption data provided through smart meters. The findings suggested a 55% reduction in uncorrelated data, which would be impressive. The particular amount of decrease was demonstrated to be highly dependent on parameters including forecasting tolerance & switching period duration.

2.1.3. Replication placement approach

In 2021, Ulabedin et al. [78] have presented a workflow scheduling strategy to resolve data transmission & complete workflow activities under tight deadlines & budgets. The suggested strategies include an initial data placement phase that clusters & distributes datasets depending on their interconnections, as well as an R-PCP methodology that organizes tasks with data locality & continuously manages the dependency matrix for the deployment of created data sets. When comparing random & ADAS approaches, R-PCP has 44.93% & 31.37% less data movement, correspondingly. When compared to the ADAS approach, R-PCP uses 26.48% less energy.

In 2020, Salem et al. [67] have provided varied costs & shortest path sides in the cloud with relation to replication as well as its location among DCs via MOO, and also the cost distance evaluated using knapsack issues. In the suggested system, the MOABC method may be employed to obtain the maximum efficiency & minimum cost. The extensive experiments show that the suggested MOABC seems to be more effective & efficient than other methods for the optimal replication location.

In 2021, Bowers et al. [7] have proposed LAST-HDFS, a solution that combines LAST with open-source HDFS. The LAST-HDFS platform implements location-aware file deployments & monitors file transactions in the cloud in real-time to prevent possibly unlawful transfers. They deployed the suggested architecture & conducted thorough empirical evaluations in large-scale real-world cloud infrastructure to establish the system’s performance & effectiveness.

In 2020, Peng et al. [38] have investigated new offline community discovery & online community adjustment strategies for scalable & adaptive replica deployment. Depending on typical read/write rates over some time, the offline strategy could determine a replica placement option. Extensive empirical analyses based on real-world data traces indicate the usefulness of the approach in handling huge databases.

In 2021, Fan et al. [15] has presented a reliability-aware & energy-efficient task replica assignment mechanism depending on the operational task replicas at slower rates & allowing numerous task replicas to use similar server resources. To decrease the number of servers necessary, many task replicas could share server resources. The suggested method has efficiently reduced energy usage while maintaining a healthy balance between the number of servers used & job completion time, as demonstrated by test findings.

In 2017, Israel et al. [9] have described a BaRRS method for scheduling scientific application operations in cloud computing settings. BaRRS parallelizes scientific workflows into several sub-workflows to balance system consumption. Four well-known scientific procedures were tested, each with a specific dependence structure & data file size. The findings were encouraging, and they also emphasized the most important elements influencing the implementation of application areas on clouds.

In 2019, Amrith et al. [69] has been described a novel fault-tolerant workflow scheduling method that develops replication heuristics in an unsupervised approach. Compared to the Replicate-All method, the suggested method enhances measures including Resource Wastage & Resource Usage yet retains an acceptable increase in Makespan when compared to the vanilla HEFT.

In 2017, Qiu et al. [64] has created models to calculate the response-time dispersion for networks wherein replica cancellation could be too expensive or impossible to perform, including “quick” technologies like web services or older technologies. Additional testing on MATLAB benchmarks as well as a three-tier web application (MediaWiki) indicates exceptional accuracy, with queries taking seconds to complete. This rigorous quantitative study provided insights into appropriate replication levels below several system circumstances.

In 2012, Mansouri et al. [44] have suggested a DHR algorithm that places replicas at the most suitable sites, i.e. the greatest site with the most access for that replica. The simulation findings with OptorSim, the European Data Grid simulation indicate that the DHR method outperforms the other techniques as well as avoids the construction of unneeded replicas, leading to more efficient storage consumption.

In 2021, Younes et al. [28] has suggested a method for allocating replicas to IoT data in the cloud computing environment depending on the HS algorithm in an attempt to lessen data access costs. The suggested technique chooses the optimum location for data replication within a cloud computing system using the HS algorithm. The suggested strategy beat the other approaches in terms of data access time & latency, as well as energy usage, as per the deployment findings.

In 2017, Wiese et al. [80] has developed a replication technique that permits several fragmentations of the same data table in a distributed database system. They also investigate the effects of data updates (insertions & deletions) on the data distribution if there were more fragmentations (resulting in the circumstance where some replication criteria were unnecessary).

2.1.4. Replication creation approach

In 2021, Javidi et al. [49] have proposed HDRS, a dynamic replication technique. HDRS comprises of replica creation, which could also adaptively increase replicas based on exponential growth or decay rates, replica placement based on the access load & labelling approach, as well as replica replacement associated with future file value. Results demonstrate that when compared to other approaches, HDRS could minimize reaction time & bandwidth utilization. By balancing the load of sites, this strategy prevents unnecessary replications & reduces access latency.

2.1.5. Replication retirement approach

In 2018, Tos et al. [76] has presented PEPRv2, Performance, & Profit Oriented Data Replication Strategy for Cloud Systems. PEPRv2 provides the tenant with both throughput & minimum availability requirements even while considering the cloud provider’s profitability. They constructed a virtual cloud system that handles tenant inquiries using a simulation platform. PEPRv2 was compared against its predecessor, PEPR, as well as another data replication approach, CDRM, that does not include the cost of cloud computing.

In 2021, Mokadem et al. [75] have introduced APER, a dynamic data replication strategy in the cloud that meets both the response time goal as well as the provider’s economic advantage. If a query was predicted to break the SLA, the suggested technique contemplates making a new replica depending on the placement heuristic to continue the execution, ensuring that the response time SLO was met whereas the provider earns a profit. They compared APER’s performance to that of PEPR & CDRM techniques. APER met the provider’s expectations and made a profit by carefully positioning copies to increase data access time while reducing resource usage.

In 2020, Guo et al. [22] have introduced Mirror, a multi-replica method to solve the challenges. They discovered that was susceptible to a storage-saving attack, in which a dishonest provider may save significant storage costs relative to the costs of honestly keeping all the replicas even while passing any issue. They also discovered that Mirror was vulnerable to replacement & forgery attacks, posing additional security dangers for cloud users. Experiments demonstrate that the system performs similarly to Mirror but maintains a high level of security.

2.1.6. Replication decision approach

In 2020, Nannai et al. [63] have developed a unique dynamic data replication technique based on the IWD algorithm to handle replication & cloud storage management concerns. The IWD algorithm, a swarm intelligence-based optimization technique, was utilized to optimize the processes of cloud storage replication & administration. They compared the D2R-IWD algorithm to common optimization approaches like PSO and GA and discovered that the methodology provides superior outcomes in terms of access effectiveness for numerous test scenarios, improving cloud performance.

In 2018, Mansouri et al. [45] was used HRS in replica placement, selection, & replacement processes. HRS was designed to replicate data files on the cloud & comprises three steps. To improve reaction time, the decision to replace was adopted. The results of the experiments show that HRS may greatly improve data-intensive application availability, performance, & load balancing. Furthermore, it performs admirably without adding to overhead costs.

In 2019, Ali et al. [4] have suggested a method named “Secure Provable Data Possession method with Replication support in the Cloud utilizing Tweaks,” which protects the CSP from deceiving the data owner by keeping fewer replicas than the SLAs stipulate but also enables dynamic data operations. For all replicas of the outsourced data blocks, they employ the MHT-based storage mechanism to provide security and integrity. They use experimental analysis to demonstrate the effectiveness of their strategy and show that it outperforms previous solutions.

In 2021, Maheshwari et al. [41] has suggested a consensus-based file replication methodology based on the message forwarding framework that tackles the previous methods’ server confidence problem. The Master–Slave protocol employs a two-layered framework that divides servers into masters and slaves. Following the suggested methodology, the updated data file would be provided instantly to the readers without any ambiguity. The protocol was conducted, as well as the experimental and theoretical results were confirmed.

In 2021, Liu et al. [36] has developed a nonlinear integer programming approach to optimize the availability of data in both sorts of failures and thereby reduce replication costs. As compared to earlier replication systems, numerical simulation findings using trace parameters as well as trials from real-world Amazon S3 revealed that MRR delivers excellent data availability, minimal data loss probability, and inexpensive consistency maintaining & storage costs.

In 2020, Castro et al. [10] has examined various approaches for database fragmentation, allocation, & replication, as well as a Web application termed FRAGMENT, which uses the work methodology chosen during the analysis step. It proposes a fragmentation and replication strategy that may be implemented in a cloud environment and seems to be simple to implement, intending to enhance the effectiveness of database operations. Testing with the TPC-E benchmarks revealed that queries conducted against the distributed database built using FRAGMENT had a faster response time than queries performed against a centralized database.

In 2017, Tziritas et al. [77] have examined the usage of data replication in conjunction with the VM assignment problem, to improve methods that determine both data should indeed be replicated wherever VMs should be transferred to reduce network overhead between standard cloud & mobile cloud platforms. As compared to the extant methods in the literature, experiment results demonstrated that the suggested technique reduces network overhead by up to 53%.

In 2019, Sheng et al. [74] has introduced a file replication approach for assuring RRSD, intending to reduce the number of copies to improve load balancing while maintaining the data dependability. To accomplish this, RRSD employs the methods of many-time replica placement & redundant replica deletion. Comprehensive testing shows that RRSD outperforms other comparable approaches in terms of load balance, data reliability, as well as storage consumption, with a 10% increase in load balance as well as a 60% reduction in storage consumption while fulfilling data reliability requirements.

In 2018, Liang et al. [34] has tackled co-residence attacks, in which a malicious attacker might steal or damage a user’s sensitive information by co-residing the attacker’s VM on the same physical server as the target user’s VM. Dynamic data replication rules were investigated and optimized using the proposed evaluation methodology. The effects of different method parameters on dynamic data sustainability & security were demonstrated using numerical results.

In 2016, Songling et al. [16] have suggested DOSN technologies to preserve data privacy. In DOSN, a user’s published data & replicas were only ever saved in the user’s friendship circle. While complete replication could increase DA, clean DOSNs may not be able to provide long-term DA. This research also suggests data placement options for achieving the required DA & enhancing other aspects of performance. Cadros’ efficiency has been verified by investigations.

In 2019, Moin et al. [25] have suggested a cloud FFTF. To apply the appropriate level of FT, FFTF allows customers to designate their activities as premium, standard, or economy. In terms of FT capacity, resource consumption, as well as utilization with an established FT architecture, the effectiveness of FFTF was studied and the results were through comprehensive simulation tests on simulated and real workloads.

In 2016, Galen et al. [40] has designed and developed an active machine learning system for temporal updating (or backcasting) of land cover data at 3 NLCD research sites. These findings show that the land cover data included in the NLCD may be efficiently retrieved for replication purposes utilizing only Landsat images. The system was completely automated & adaptable at numerous points in time at the landscape as well as regional sizes.

2.1.7. Replication decision approach

In 2016, Nahir et al. [62] has created a distinctive technique that eliminates any scheduling overhead from the task’s critical route by incurring no communication overhead between users and service providers upon work arrival. The strategy involved making several copies of each work and transmitting each copy to a separate server. They propose a heuristic solution to the performance loss that occurs in such situations and demonstrate that it effectively mitigates the negative effects of propagation delays through experiments.

In 2015, Sreekumar et al. [79] has implemented a dynamic data replication mechanism to improve the efficiency of the software application. They evaluate the popularity degree as well as the replica factor to choose the best file to replicate as well as the appropriate number of replicas. They utilize the round-robin approach to arrange the replicas in the specified systems, but they use the fuzzy logic system for determining the system to position the replicas. They evaluate the approach’s effectiveness to traditional algorithms.

2.1.8. Static and dynamic replication

In 2021, Shakarami et al. [70] this study gives a thorough analysis and classification of state-of-the-art data replication schemes among several existing cloud computing solutions in the form of a classical classification to characterize current schemes on the subject and discuss open challenges. The three key categories in the classification that is being offered are data management, data auditing, and data de-duplication systems. A thorough analysis of the replication schemes emphasizes their key characteristics, including the classes they use, the type of scheme, the location of implementation, the evaluation methods, and their strengths and shortcomings. Table 2 shows the reviews on the existing model.

In 2021, Séguéla et al. [68] have provide the dynamic data replication technique (DE2ARS) in this research changes the number of copies based on the workload and tackles difficulties with energy consumption and cost. It is initiated by a Control Chart and occurs after an initial placement. To properly analyze the suggested technique, we first contrast various parameter options. We contrast DE2ARS with methods found in the literature.

In 2021, Hamrouni et al. [23] offers a thorough examination of the data replication techniques now in use in cloud systems, including both standalone and networked clouds. We also describe critical steps for data correlation-aware techniques. In addition, we look at the characteristics of the main techniques, such as how replication problems are addressed, how providers and consumers are prioritized, how service level agreements are taken into account, how cost and economic factors are taken into account, and how assessment tools are used. Finally, using extensive simulations of several replication algorithms designed for standalone and networked clouds, we present a performance study.

In 2022, Mokadem et al. [60] provides a new classification of data replication tactics in cloud systems in this research. It also considers a number of other factors that are unique to cloud settings, including (i) the profit orientation, (ii) the examined objective function, (iii) the number of tenant objectives, (iv) the cloud environment’s characteristics, and (v) the assessment of economic expenses. Regarding the final criterion, we concentrate on the provider’s financial gain and take into account the provider’s energy use.

2.1.10. Economic profit

As a result, getting the most economic benefit at the lowest possible operating cost may not always coincide with achieving satisfactory performance. A replica is actually only constructed if a node that could receive a new duplicate is located, even if a replication is taken into consideration (per-query or per set of queries). Moreover, the provider needs to make money from this duplication. Before choosing to duplicate (before Q is executed), the provider’s economic advantage (Q_Profit) is also calculated for this purpose. As a result, the provider’s estimated revenues (Q_Revenues) and expenses (Q_Expenses), as indicated by Formula (1), are determined. (1) Q _ Revenues − Q _ Expenses = Q _ Profit

In order to ensure profitability for the provider when implementing Q, its income must exceed its expenses when several renters are served.