SLA Based Dynamic Virtualized Resources Provisioning for Shared Cloud Data Centers
Authors:
- Zhiliang ZhuZZZhiliang Zhu
- Jing BiJBJing Bi
- Haitao YuanHYHaitao Yuan
- Ying ChenYCYing Chen
- 1 July 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21596182,p. 630-637
Abstract
Cloud computing focuses on delivery of reliable, secure, sustainable, dynamic and scalable resources provisioning for hosting virtualized application services in shared cloud data centers. For an appropriate provisioning mechanism, we developed a novel cloud data center architecture based on virtualization mechanisms for multi-tier applications, so as to reduce provisioning overheads. Meanwhile, we proposed a novel dynamic provisioning technique and employed a flexible hybrid queueing model to determine the virtualized resources to provision to each tier of the virtualized application services. We further developed meta-heuristic solutions, which is according to different performance requirements of users from different levels. Simulation experiment results show that these proposed approaches can provide appropriate way to judiciously provision cloud data center resources, especially for improving the overall performance while effectively reducing the resource usage extra cost and maximizing the global profit of cloud infrastructure providers.Keywords
This publication has 12 references indexed in Scilit:
- Self-adaptive and self-configured CPU resource provisioning for virtualized servers using Kalman filters2009
- Agile dynamic provisioning of multi-tier Internet applicationsACM Transactions on Autonomous and Adaptive Systems, 2008
- Application Resource Demand Phase Analysis and Prediction in Support of Dynamic Resource Provisioning2007
- On the Use of Fuzzy Modeling in Virtualized Data Center Management2007
- Autonomic Virtualized Environments2006
- Tabu Search2006
- Utility functions in autonomic systems2004
- Xen and the art of virtualization2003
- Full convergence of the steepest descent method with inexact line searchesOptimization, 1995
- A generalization of little's law to moments of queue lengths and waiting times in closed, product-form queueing networksJournal of Applied Probability, 1989