Location-Constrained Virtual Machine Placement (LCVP) Algorithm

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Virtual machine (VM) placement is the current day research topic in cloud computing area. In order to solve the problem of imposing location constraints on VMs to meet their requirements in the process of VM placement, the location-constrained VM placement (LCVP) algorithm is proposed in this paper. In LCVP, each VM can only be placed onto one of the specified candidate physical machines (PMs) with enough computing resources and there must be sufficient bandwidth between the selected PMs to meet the communication requirement of the corresponding VMs. Simulation results show that LCVP is feasible and outperforms other benchmark algorithms in terms of computation time and blocking probability.

Cite

CITATION STYLE

APA

Liu, Z., Lu, J., Su, N., Zhang, B., & Li, X. (2020). Location-Constrained Virtual Machine Placement (LCVP) Algorithm. Scientific Programming, 2020. https://doi.org/10.1155/2020/8846087

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