一种超额认购虚拟数据中心的嵌入算法

An algorithm for embedding oversubscribed virtual data center

多租户数据中心环境下,保证云应用性能的一个重要因素是为租户应用提供可保证的通信带宽,这可以通过为每个租户提供一个独占的虚拟数据中心(VDC)来实现。研究了在物理数据中心网络中超额认购数据中心的嵌入问题。相对于一般虚拟数据中心,超额认购虚拟数据中虚拟机之间的流量模式更加复杂,因此首先利用线性规划方程阐述了流量模型及嵌入问题。对于虚拟机嵌入问题,提出了一种具有较低时间复杂度的启发式算法——分组扰动算法。最后,通过仿真实验将分组扰动算法和先前工作中提出的算法以及著名的first-fit进行了比较,实验表明所提算法在降低算法复杂度的同时提高了嵌入成功率。

Predictable network performance is critical for cloud applications and can be achieved by providing te- nants a dedicated virtual data center （VDC） with bandwidth guarantee. The embedding problem of oversubscribed data center in physical data center network was studied. Compared with the general virtual data center, the traffic pat- tbrri between the virtual machines in the over-subscription virtual data was more complicated. Therefore, the flow model and the embedding problem were described. A heuristic algorithm with lower time complexity was proposed for the embedding problem of virtual machine-packet perturbation algorithm. Finally, the simulation algorithm was used to compare the packet perturbation algorithm with the algorithm proposed in the previous work and the famous first-fit. The experiment result shows that the proposed algorithm improves the embedding success rate while reduc- ing the complexity of the algorithm.