An Algorithm for Finding the Minimum Cost of Storing and Regenerating Datasets in Multiple Clouds - 2018


The proliferation of Cloud Computing allows users to flexibly store, re-compute or transfer large generated datasets with multiple cloud service providers. However, because of the pay-as-you-go model, the overall value of using cloud services depends on the consumption of storage, computation and bandwidth resources that are 3 key factors for the value of IaaS-based mostly cloud resources. So as to scale back the entire value for knowledge, given cloud service suppliers with completely different pricing models on their resources, users will flexibly opt for a cloud service to store a generated dataset, or delete it and choose a cloud service to regenerate it whenever reused. But, finding the minimum value could be a complicated yet unsolved drawback. In this Project, we tend to propose a novel algorithm that may calculate the minimum value for storing and regenerating datasets in clouds, i.e., whether datasets should be stored or deleted, and furthermore where to store or to regenerate whenever they are reused. This minimum price also achieves the best trade-off among computation, storage and bandwidth prices in multiple clouds. Comprehensive analysis and rigid theorems guarantee the theoretical soundness of the paper, and general (random) simulations conducted with fashionable cloud service providers' pricing models demonstrate the excellent performance of our approach.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Multi-hop Deflection Routing Algorithm Based on Reinforcement Learning for Energy-Harvesting Nanonetworks ABSTRACT: Nanonetworks are made up of nano-nodes that interact with one another, and the size of these nano-nodes
PROJECT TITLE : Mining High Quality Patterns Using Multi-Objective Evolutionary Algorithm ABSTRACT: The term "pattern mining," or PM for short, refers to the process of extracting from data patterns that are of interest to users.
PROJECT TITLE : SCHAIN-IRAM: An Efficient and Effective Semi-Supervised Clustering Algorithm for Attributed Heterogeneous Information Networks ABSTRACT: A heterogeneous information network, also known as an HIN, is a network in
PROJECT TITLE : FastDTW is approximate and Generally Slower than the Algorithm it Approximates ABSTRACT: The repeated application of distance measure is one solution that can be used for many issues that arise when mining time
PROJECT TITLE : Near-Optimal Energy-Efficient Algorithm for Virtual Network Function Placement ABSTRACT: Network Function Virtualization, or NFV, is a relatively new networking technology that was developed in the hope that it

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry