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. Index Terms-Content delivery networks, network function virtualization, virtual network function, cost, placement.
In REF , a chain end-point is considered to be unknown before placement.
CPVNF: Cost-Efficient Proactive VNF Placement and Chaining for Value-Added Services in Content Delivery Networks
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management
Computer Science