Network Service Embedding Across Multiple Resource Dimensions

Abstract

Network Function Virtualization (NFV) poses the need for efficient embeddings of network services, usually defined in the form of service graphs, associated with resource and bandwidth demands. As the scope of NFV has been expanded in order to meet the requirements of virtualized cellular networks and emerging 5G services, the diversity of resource demands across dimensions, such as CPU, memory, and storage, increased. This requirement exacerbates the already challenging problem of network service embedding (NSE), rendering most existing NSE methods inefficient, as they commonly account for a single resource dimension ( i.e. , typically, the CPU). In this context, we investigate methods for NSE optimization across multiple resource dimensions. To this end, we study a range of multi-dimensional mapping efficiency metrics and assess their suitability for heuristic and exact NSE methods. Utilizing the most suitable and efficient metrics, we propose two heuristics and a mixed integer linear program (MILP) for optimized multi-dimensional NSE. In addition, we devise a virtual network function (VNF) bundling scheme that generates (resource-wise) balanced VNF bundles in order to augment VNF placement. Our evaluation results indicate notable resource efficiency gains of the proposed heuristics compared to a single-dimensional counterpart, as well as a minor degree of sub-optimality in relation to our proposed MILP. We further demonstrate how the bundling scheme affects the embedding efficiency, when coupled with our most efficient heuristic. Our study also uncovers interesting insights and potential implications from the utilization of multi-dimensional metrics within NSE methods.