Reliable Virtual Machine placement in distributed clouds
Reliable Virtual Machine placement in distributed clouds
复制标题
分布式云中可靠的虚拟机放置
DOI：
10.1109/rndm.2016.7608297
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
R. Yahyapour
中科院分区：
文献类型：
--
作者：
Song Yang;P. Wieder;R. Yahyapour
在当今的云计算系统中，利用虚拟化技术，客户所请求的数据计算或存储服务由一组相互通信的虚拟机(VM)以可扩展和弹性的方式来容纳。根据节点的容量、故障概率等，这些VM被放置在一个或多个数据中心节点中。VM放置可用性是指在整个请求的生命周期内，至少有一组客户请求的VM运行的概率。放置的VM应遵守商定的可用性，否则云提供商可能面临收入损失。在本文中，我们研究了在最少的数据中心节点上放置至多H组的k个请求的VM的问题，使得满足VM放置的可用性要求并且每个VM对具有不大于规定的通信延迟。我们证明了这个问题是NP-难的。随后，我们提出了一个精确的整数非线性规划(INLP)和一个有效的启发式算法来解决这个问题。最后，在接受率、平均使用节点数和运行时间等方面与现有的两种启发式算法进行了仿真比较。
In nowadays cloud computing systems, leveraging the virtualization technology, the customer's requested data computing or storing service is accommodated by a set of mutual-communicated Virtual Machines (VM) in a scalable and elastic manner. These VMs are placed in one or more datacenter nodes according to nodes' capacities, failure probabilities, etc. The VM placement availability refers to the probability that at least one set of the whole customer's requested VMs operates during the entire requested lifetime. The placed VMs should obey the agreed-upon availability, otherwise the cloud provider may face revenue loss. In this paper, we study the problem of placing at most H sets of k requested VMs on minimum number of datacenter nodes, such that the VM placement availability requirement is satisfied and each VM pair has a communication delay no greater than the specified. We prove that this problem is NP-hard. We subsequently propose an exact Integer Nonlinear Program (INLP) and an efficient heuristic to solve this problem. Finally, we conduct simulations to compare the proposed algorithms with two existing heuristics in terms of acceptance ratio, average number of used nodes and running time.