A fast robust optimization-based heuristic for the deployment of green virtual network functions. (1st October 2017)

• Record Type: Journal Article
• Authors: Marotta, Antonio; Zola, Enrica; D'Andreagiovanni, Fabio; Kassler, Andreas
• Is Part Of: Journal of network and computer applications. Volume 95(2017)
• Page Start: 42
• Page End: 53
• Publication Date: 2017-10-01
• Subjects: Network Function Virtualization (NFV) -- Robust optimization (RO) -- VNF -- 5G -- VNF placement heuristic -- Datacenter; Microcomputers -- Periodicals; Computer networks -- Periodicals; Application software -- Periodicals; Micro-ordinateurs -- Périodiques; Réseaux d'ordinateurs -- Périodiques; Logiciels d'application -- Périodiques; Application software; Computer networks; Microcomputers; Periodicals; 004.05; 004
• DOI: 10.1016/j.jnca.2017.07.014
• Languages: English
• ISSNs: 1084-8045

Abstract

Abstract: Network Function Virtualization (NFV) has attracted a lot of attention in the telecommunication field because it allows to virtualize core-business network functions on top of a NFV Infrastructure. Typically, virtual network functions (VNFs) can be represented as chains of Virtual Machines (VMs) or containers that exchange network traffic which are deployed inside datacenters on commodity hardware. In order to achieve cost efficiency, network operators aim at minimizing the power consumption of their NFV infrastructure. This can be achieved by using the minimum set of physical servers and networking equipment that are able to provide the quality of service required by the virtual functions in terms of computing, memory, disk and network related parameters. However, it is very difficult to predict precisely the resource demands required by the VNFs to execute their tasks. In this work, we apply the theory of robust optimization to deal with such parameter uncertainty. We model the problem of robust VNF placement and network embedding under resource demand uncertainty and network latency constraints using robust mixed integer optimization techniques. For online optimization, we develop fast solution heuristics. By using the virtualized Evolved Packet Core as use case, we perform a comprehensive evaluation in terms of performance, solution time and complexity and show that our heuristic can calculate robust solutions for large instances under one second.