Constraint Programming based Virtual Cloud Resources Allocation Model

  • Zhang L
  • Zhuang Y
  • Zhu W
N/ACitations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

Cloud computing is growing in popularity among computing paradigms, and many corporate data centers are in the process of adopting a cloud computing architecture where resources are provisioned on a per-demand basis. The goal of a cloud infrastructure provider is to maximize its profit by minimizing the amount of violations of Quality-of-Service(QoS), and, at the same time, by lowering infrastructure costs. However, allocating virtual resources in cloud computing environment is very complex, and it's very difficult to manage virtual resources when the corporate data centers scale up. In this paper, we propose a dynamic constraint programming based virtual resources allocation model, which not only takes into account meeting user's QoS requirements, but also considers the cost of virtual cloud resources. We utilize constraint programming approach to solve the virtual resource provisioning and packing problem, and we validate our model through simulation experiments. We show, through simulation results, that our model is able to efficiently allocate and manage the virtual resources of the cloud platform. Compared with other traditional models, our model can significantly reduce QoS violations and achieve lower resource usage costs.

Cite

CITATION STYLE

APA

Zhang, L., Zhuang, Y., & Zhu, W. (2013). Constraint Programming based Virtual Cloud Resources Allocation Model. International Journal of Hybrid Information Technology, 6(6), 333–344. https://doi.org/10.14257/ijhit.2013.6.6.30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free