云中可靠的虚拟机放置和路由
Reliable Virtual Machine Placement and Routing in Clouds
摘要：
在当前的云计算系统中，当利用虚拟化技术时，客户所请求的数据计算或存储服务由一组通信的虚拟机（VM）以可伸缩和弹性的方式来提供。这些VM根据节点容量或故障概率被放置在一个或多个服务器节点中。VM放置可用性是指客户的所有请求的VM中的至少一个集合在请求的寿命期间操作的概率。在本文中，我们首先研究的问题，放置在最少数量的节点上的最多H组的k个请求的VM，使得VM放置的可用性不小于$δ$，并且指定的通信延迟和连接可用性为每个VM对下同一放置组不违反。我们考虑了这个问题的共享风险节点组（SRNG）故障，并证明了这个问题在这两种情况下是NP-难的。随后，我们提出了一个精确的非线性规划（INLP）和一个有效的启发式算法来解决这个问题。我们进行了模拟，比较所提出的算法与现有的两种算法的性能。最后，我们研究了相关的可靠路由问题，建立连接的最多w个链路不相交的路径从一个源到一个目的地，使连接的可用性要求得到满足，每条路径的延迟不超过一个给定的值。我们设计了一个精确的算法和两个算法来解决这个NP难问题，并通过模拟来评估它们。
英文摘要：
In current cloud computing systems, when leveraging virtualization technology, the customer's requested data computing or storing service is accommodated by a set of communicated virtual machines (VM) in a scalable and elastic manner. These VMs are placed in one or more server nodes according to the node capacities or failure probabilities. The VM placement availability refers to the probability that at least one set of all customer's requested VMs operates during the requested lifetime. In this paper, we first study the problem of placing at most H groups of k requested VMs on a minimum number of nodes, such that the VM placement availability is no less than $δ$, and that the specified communication delay and connection availability for each VM pair under the same placement group are not violated. We consider this problem with and without Shared-Risk Node Group (SRNG) failures, and prove this problem is NP-hard in both cases. We subsequently propose an exact Integer Nonlinear Program (INLP) and an efficient heuristic to solve this problem. We conduct simulations to compare the proposed algorithms with two existing heuristics in terms of performance. Finally, we study the related reliable routing problem of establishing a connection over at most w link-disjoint paths from a source to a destination, such that the connection availability requirement is satisfied and each path delay is no more than a given value. We devise an exact algorithm and two heuristics to solve this NP-hard problem, and evaluate them via simulations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
