arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.3683cs.NI
收藏

一种基于带宽感知的VM最优分配算法

Optimal bandwidth-aware VM allocation for Infrastructure-as-a-Service

Debojyoti Dutta, Michael Kapralov, Ian Post, Rajendra Shinde

摘要:

云计算结构即服务(IaaS)提供商需要提供更丰富的服务以保持竞争力,同时优化其资源使用以降低成本。更丰富的服务包括新的资源请求模型,涉及虚拟机(VM)之间的带宽保证。因此,我们考虑以下问题:给定一个VM请求图(其中节点是VM,边缘代表VM之间的虚拟网络连接)和一个真实的数据中心拓扑结构,找到一个VM到服务器的分配,该分配满足每个虚拟网络边缘的带宽保证--映射到物理网络中的路径--并最大限度地减少网络拥塞。以前的工作表明,对于任意的网络和请求,找到满足带宽要求的最佳嵌入是$\mathcal{NP}$困难的。然而,在大多数数据中心架构中,所采用的路由协议基于物理网络的生成树。在本文中,我们证明了该问题仍然是$\mathcal{NP}$ -困难的,即使在物理网络拓扑结构被限制为树,并且请求图拓扑结构也受到限制。我们还提出了一个动态规划算法,用于计算最佳嵌入树网络中运行的时间$O(3^kn)$,其中$n$是物理拓扑中的节点数和$k$是请求图的大小,这是非常适合于实际的请求,具有小的$k$。这样的请求形成了一大类Web服务和企业工作负载。此外,如果我们限制的请求拓扑结构的一个集团(所有虚拟机连接到一个虚拟交换机具有统一的带宽要求),我们表明,动态规划算法可以修改输出的最小拥塞嵌入时间$O(k^2n)$。

英文摘要:

Infrastructure-as-a-Service (IaaS) providers need to offer richer services to be competitive while optimizing their resource usage to keep costs down. Richer service offerings include new resource request models involving bandwidth guarantees between virtual machines (VMs). Thus we consider the following problem: given a VM request graph (where nodes are VMs and edges represent virtual network connectivity between the VMs) and a real data center topology, find an allocation of VMs to servers that satisfies the bandwidth guarantees for every virtual network edge---which maps to a path in the physical network---and minimizes congestion of the network. Previous work has shown that for arbitrary networks and requests, finding the optimal embedding satisfying bandwidth requests is $\mathcal{NP}$-hard. However, in most data center architectures, the routing protocols employed are based on a spanning tree of the physical network. In this paper, we prove that the problem remains $\mathcal{NP}$-hard even when the physical network topology is restricted to be a tree, and the request graph topology is also restricted. We also present a dynamic programming algorithm for computing the optimal embedding in a tree network which runs in time $O(3^kn)$, where $n$ is the number of nodes in the physical topology and $k$ is the size of the request graph, which is well suited for practical requests which have small $k$. Such requests form a large class of web-service and enterprise workloads. Also, if we restrict the requests topology to a clique (all VMs connected to a virtual switch with uniform bandwidth requirements), we show that the dynamic programming algorithm can be modified to output the minimum congestion embedding in time $O(k^2n)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑