CPVNF: Cost-Efficient Proactive VNF Placement and Chaining for Value-Added Services in Content Delivery Networks

被引:69
作者
Dieye, Mouhamad [1 ]
Ahvar, Shohreh [2 ,4 ]
Sahoo, Jagruti [3 ]
Ahvar, Ehsan
Glitho, Roch [5 ,6 ]
Elbiaze, Halima [1 ]
Crespi, Noel [2 ]
机构
[1] Univ Quebec Montreal, Dept Comp Sci, Montreal, PQ H3C 3P8, Canada
[2] Telecom SudParis, Inst Mines Telecom, CNRS 5157, Paris, France
[3] South Carolina State Univ, Dept Math & Comp Sci, Orangeburg, SC 29117 USA
[4] Univ Rennes, Inria, CNRS, IRISA, F-35042 Rennes, France
[5] Concordia Univ, Concordia Inst Informat Syst Engn, Montreal, PQ H3G 1M8, Canada
[6] Univ Western Cape, Comp Sci Programme, ZA-7535 Cape Town, South Africa
来源
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT | 2018年 / 15卷 / 02期
基金
加拿大自然科学与工程研究理事会;
关键词
Content delivery networks; network function virtualization; virtual network function; cost; placement; ALGORITHM; MODEL;
D O I
10.1109/TNSM.2018.2815986
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Value-added services (e.g., overlaid video advertisements) have become an integral part of today's content delivery networks (CDNs). To offer cost-efficient, scalable, and more agile provisioning of new value-added services in CDNs, network functions virtualization paradigm may be leveraged to allow implementation of fine-grained services as a chain of virtual network functions (VNFs) to be placed in CDN. The manner in which these chains are placed is critical as it both affects the quality of service (QoS) and provider cost. The problem is however, very challenging due to the specifics of the chains (e.g., one of their end-points is not known prior to the placement). We formulate it as an integer linear program and propose a cost efficient proactive VNF placement and chaining algorithm. The objective is to find the optimal number of VNFs along with their locations in such a manner that the cost is minimized while QoS is met. Apart from cost minimization, the support for large-scale CDNs with a large number of servers and end-users is an important feature of the proposed algorithm. Through simulations, the algorithm's behavior for small-scale to large-scale CDN networks is analyzed.
引用
收藏
页码:774 / 786
页数:13
相关论文
共 44 条
  • [1] Ahuja RK, 1993, Network flows
  • [2] [Anonymous], 2015, 1 IEEE C NETW SOFTW
  • [3] [Anonymous], 2013, 001 ETSI GS NFV
  • [4] [Anonymous], 2015, P 6 INT C NETW FUT
  • [5] [Anonymous], 2015, P OPT FIB COMM C EXH
  • [6] [Anonymous], 2017, 2017 IEEE INT C COMM
  • [7] [Anonymous], C1148136001 CISC
  • [8] Bari MF, 2015, INT CONF NETW SER, P50, DOI 10.1109/CNSM.2015.7367338
  • [9] Bianchini M., 2005, ACM Transactions on Internet Technology, V5, P92, DOI 10.1145/1052934.1052938
  • [10] The anatomy of a large-scale hypertextual Web search engine
    Brin, S
    Page, L
    [J]. COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7): : 107 - 117