Virtual Network Function Placement Considering Resource Optimization and SFC Requests in Cloud Datacenter

被引:132
作者
Li, Defang [1 ]
Hong, Peilin [1 ]
Xue, Kaiping [1 ]
Pei, Jianing [1 ]
机构
[1] Univ Sci & Technol China, Chinese Acad Sci, Sch Informat Sci & Technol, Key Lab Wireless Opt Commun, 96 Jinzhai Rd, Hefei 230026, Anhui, Peoples R China
基金
中国国家自然科学基金;
关键词
Virtual network function placement; resource optimization; service function chain; time-varying workloads; multi-tenancy; basic resource consumptions; correlation-based algorithm;
D O I
10.1109/TPDS.2018.2802518
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Network function virtualization (NFV) brings great conveniences and benefits for the enterprises to outsource their network functions to the cloud datacenter. In this paper, we address the virtual network function (VNF) placement problem in cloud datacenter considering users' service function chain requests (SFCRs). To optimize the resource utilization, we take two less-considered factors into consideration, which are the time-varying workloads, and the basic resource consumptions (BRCs) when instantiating VNFs in physical machines (PMs). Then the VNF placement problem is formulated as an integer linear programming (ILP) model with the aim of minimizing the number of used PMs. Afterwards, a Two-StAge heurisTic solution (T-SAT) is designed to solve the ILP. T-SAT consists of a correlation-based greedy algorithm for SFCR mapping (first stage) and a further adjustment algorithm for virtual network function requests (VNFRs) in each SFCR (second stage). Finally, we evaluate T-SAT with the artificial data we compose with Gaussian function and trace data derived from Google's datacenters. The simulation results demonstrate that the number of used PMs derived by T-SAT is near to the optimal results and much smaller than the benchmarks. Besides, it improves the network resource utilization significantly.
引用
收藏
页码:1664 / 1677
页数:14
相关论文
共 31 条
  • [1] A scalable, commodity data center network architecture
    Al-Fares, Mohammad
    Loukissas, Alexander
    Vahdat, Amin
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2008, 38 (04) : 63 - 74
  • [2] [Anonymous], 2016, INFOCOM 2016 THE 35, DOI 10.1109/INFOCOM.2016.7524565
  • [3] [Anonymous], BEA WEBL APPL CONS S
  • [4] [Anonymous], 2017, ANAL LIGHTWEIGHT VIR
  • [5] Banks D., 2009, MULTITENANCY CLOUD B
  • [6] Bari MF, 2015, INT CONF NETW SER, P50, DOI 10.1109/CNSM.2015.7367338
  • [7] Bezemer C.-P., 2010, Proceedings of the Joint ERCIM Workshop on Software Evolution (EVOL) and International Workshop on Principles of Software Evolution (IWPSE), P88
  • [8] Chi PW, 2015, IEEE ICC, P5290, DOI 10.1109/ICC.2015.7249164
  • [9] Cohen Rami, 2015, 2015 IEEE Conference on Computer Communications (INFOCOM). Proceedings, P1346, DOI 10.1109/INFOCOM.2015.7218511
  • [10] Gibb Glen., 2012, Proceed- ings of the first workshop on Hot topics in software defined networks, HotSDN '12, P73