A Flexible Dynamic Migration Strategy for Cloud Data Replica

In order to decrease the power corporation's data center construction and maintenance costs, a better solution is used by cloud computing data center. By using cloud computing data centers, power corporations can store geographically distributed users' data to meet the lower cost to meet the user's latency requirements. This electronic document is a "live" template and yet defines the components of your paper [title, text, heads, etc.] in its style sheet. This paper proposes a dynamic adaptive migration strategy for data replicas in cloud environment. Based on the workload based cloud computing, a dynamic scheduling mechanism is proposed to achieve a higher scalability, and increase the fault tolerance, and improve the ability to respond to changes in workload. The mechanism adjusts the number of replicas by changing the number of transaction requests monitored by the workload processor. By monitoring the workload to determine significant changes, a small step to repartition, and ultimately we achieve the purpose of maintaining a good overall partition. Through the dynamic data copy migration strategy, the dynamic data exchange between data nodes is completed. The experimental results show that the proposed method can significantly reduce the frequency of distributed transactions when the workload changes.

[1]  Frank Leymann,et al.  A Framework for Optimized Distribution of Tenants in Cloud Applications , 2010, 2010 IEEE 3rd International Conference on Cloud Computing.

[2]  Gustavo Alonso,et al.  Database replication , 2010, Proc. VLDB Endow..

[3]  Rajkumar Buyya,et al.  Modeling and simulation of scalable Cloud computing environments and the CloudSim toolkit: Challenges and opportunities , 2009, 2009 International Conference on High Performance Computing & Simulation.

[4]  Kenneth Salem,et al.  Lazy database replication with snapshot isolation , 2006, VLDB.

[5]  Amir Masoud Rahmani,et al.  PDDRA: A new pre-fetching based dynamic data replication algorithm in data grids , 2012, Future Gener. Comput. Syst..

[6]  Adel M. Alimi,et al.  A New Data Placement Approach for Scientific Workflows in Cloud Computing Environments , 2016, ISDA.

[7]  Raghu Ramakrishnan,et al.  Efficient bulk insertion into a distributed ordered table , 2008, SIGMOD Conference.

[8]  Ajay Mohindra,et al.  Resource Calculations with Constraints, and Placement of Tenants and Instances for Multi-tenant SaaS Applications , 2008, ICSOC.

[9]  Paul J. Schweitzer,et al.  Problem Decomposition and Data Reorganization by a Clustering Technique , 1972, Oper. Res..

[10]  Jesús Carretero,et al.  Branch replication scheme: A new model for data replication in large scale data grids , 2010, Future Gener. Comput. Syst..

[11]  Wilson C. Hsieh,et al.  Bigtable: A Distributed Storage System for Structured Data , 2006, TOCS.

[12]  Linna Du,et al.  Pricing and Resource Allocation in a Cloud Computing Market , 2012, 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012).

[13]  Xiao Liu,et al.  A data placement strategy in scientific cloud workflows , 2010, Future Gener. Comput. Syst..

[14]  Yun Yang,et al.  Improving Cloud-Based Online Social Network Data Placement and Replication , 2016, 2016 IEEE 9th International Conference on Cloud Computing (CLOUD).