Open AccessCost Optimization Algorithm for Data Center Management in Cloud
Author(s) -
K Sai Prasanthi*,
Anand Subash,
B. S. Manoj,
P. Prem Kiran
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.b7897.129219
Subject(s) - provisioning , cloud computing , reservation , computer science , asset (computer security) , plan (archaeology) , term (time) , database , algorithm , computer security , computer network , operating system , physics , archaeology , quantum mechanics , history
One of the main challenge in cloud is Cost Optimization. In cloud computing, the cloud providers usually calls CSP offer provisioning plans for the cloud consumers in the following two ways one is reservation plan(also referred as long term plan) and the other is on-demand plan(also referred as short term plan). In general, cost of computing asset provisioned by reservation plan is cheaper when compared to cost obtained by the on-demand plan, With the reservation plan, the consumer can reduce the total asset provisioning cost since cloud consumer has to pay to provider in advance. However, the best advance reservation of assets is difficult to be accomplish due to uncertainty of cloud consumer’s future demand and providers’ resource prices. To address this problem, an OCRP algorithm is proposed by formulating a SPI model. The OCRP algorithm can provision computing assets for being used in multiple provisioning stages as well as a long-term plan. The demand and price uncertainty is considered in OCRP. In this project, different approaches to obtain the solution of the OCRP algorithm are considered including DEF, SAA and Benders decomposition. Numerical the studies are extensively performed in which the outcomes clearly show that with the OCRP algorithm, cloud consumer can successfully minimize total cost of asset provisioning in cloud computing environments