An algorithm for embedding oversubscribed virtual data center

Chukun LU; Fangfang YAN; Dong LI

doi:10.11959/j.issn.1000−0801.2017104

您当前的位置：

首页 >

文章列表页 >

An algorithm for embedding oversubscribed virtual data center

research and development | 更新时间：2024-06-05

- An algorithm for embedding oversubscribed virtual data center
- Telecommunications Science Vol. 33, Issue 7, Pages: 76-87(2017)
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：10.11959/j.issn.1000−0801.2017104
  CLC： TN919
- Published Online：2017-07，
  
  Published：20 July 2017
- 稿件说明：
移动端阅览
Chukun LU, Fangfang YAN, Dong LI. An algorithm for embedding oversubscribed virtual data center[J]. Telecommunications science, 2017, 33(7): 76-87.
DOI：

Chukun LU, Fangfang YAN, Dong LI. An algorithm for embedding oversubscribed virtual data center[J]. Telecommunications science, 2017, 33(7): 76-87. DOI： 10.11959/j.issn.1000−0801.2017104.

摘要

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

Abstract

Predictable network performance is critical for cloud applications and can be achieved by providing tenants 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 pattern 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 reducing the complexity of the algorithm.

关键词

Keywords

references

BARI M F , BOUTABA R , ESTEVES R , et al . Data center network virtualization:a survey [J ] . IEEE Communications Surveys ＆ Tutorials , 2013 , 15 ( 2 ): 909 - 928 .

MOGUL J C , POPA L . What we talk about when we talk about cloud network performance [J ] . ACM SIGCOMM Computer Communication Review , 2012 , 42 ( 5 ): 44 - 48 .

BALLANI H , COSTA P , KARAGIANNIS T , et al . Towards predictable datacenter networks [C ] // ACM SIGCOMM Conference,August 15-19,2011,Toronto,Canada . New York:ACM Press , 2011 : 242 - 253 .

KAWAMURA M , AKABANE S , ITO K , et al . Optimal bandwidth-aware VM allocation for Infrastructure-as-a-Service [J ] . Computer Science , 2012 , 5 ( 4 ): 603 - 612 .

ZHU J , LI D , WU J , et al . Towards bandwidth guarantee in multi-tenancy cloud computing networks [C ] // IEEE International Conference on Network Protocols,October 30-November 2,2012,Austin,Texas,USA . New Jersey:IEEE Press , 2012 : 1 - 10 .

YAN F , LEE T T , HU W . Congestion-aware embedding of heterogeneous bandwidth virtual data centers with hose model abstraction [J ] . IEEE/ACM Transactions on Networking , 2016 ( 99 ): 1 - 14 .

魏祥麟 , 陈鸣 , 范建华 , 等 . 数据中心网络的体系结构 [J ] . 软件学报 , 2013 ( 2 ): 295 - 316 .

WEI X L , CHEN M , FAN J H , et al . Architecture of the data center network [J ] . Journal of Software , 2013 ( 2 ): 295 - 316 .

MARRIS E . Rambunctious garden:saving nature in a post-wild world [M ] . New York : Bloomsbury PublishingPress , 2013 .

ERLEBACH T , RUEGG M . Optimal bandwidth reservation in hose-model VPNs with multi-path routing [J ] . IEEE INFOCOM , 2004 , 4 ( 4 ): 2275 - 2282 .

KUMAR A , RASTOGI R , SILBERSCHATZ A , et al . Algorithms for provisioning virtual private networks in the hose model [J ] . IEEE/ACM Transactions on Networking , 2002 , 10 ( 4 ): 565 - 578 .

KARMARKAR N . A new polynomial-time algorithm for linear programming [J ] . Combinatorica , 1984 , 4 ( 4 ): 373 - 395 .

MEYERHENKE H , SANDERS P , SCHULZ C . Partitioning complex networks via size-constrained clustering [M ] . Springer-Verlag : Springer International PublishingPress , 2014 : 351 - 363 .

GONZALEZ T F . Clustering to minimize the maximum intercluster distance [J ] . Theoretical Computer Science , 1985 , 38 ( 2-3 ): 293 - 306 .

DALLY W J , TOWLES B P . Principles and practices of interconnection networks [M ] . Netherlands : Amsterdam Elsevier PublishingPress , 2004 .

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

An implementation of the“active-active”data center

Development Prospects of Software Defined Optical Networks

Architecture design, key technologies, and application research of GPU heterogeneous resource pool platform based on virtualization

5G industry wireless private network technology and business requirement model

AI-enabled 5G energy-saving technology

Related Author

Hao FAN

Yuefeng Ji

Jie Zhang

Yongli Zhao

ZHANG Wancai

ZHANG Nan

YANG Wenqing

WANG Tao

Related Institution

Nari Technology Development Co., Ltd.

Pudong Power Supply Company Under Shanghai Municipal Electric Power Corporation

Shanghai Zhongxing Power Construction Development Co.,Ltd.

Guangzhou Research Institute of China Telecom Co., Ltd.

Guangdong Branch of China Telecom Co., Ltd.

⁰