On the computational complexity of the virtual network embedding problem

Given a graph representing a substrate (or physical) network with node and edge capacities and a set of virtual networks with node capacity demands and node-tonode traffic demands, the Virtual Network Embedding problem (VNE) calls for an embedding of (a subset of) the virtual networks onto the substrate network which maximizes the total profit while respecting the physical node and edge capacities. In this work, we investigate the computational complexity of VNE. In particular, we present a polynomial-time reduction from the maximum stable set problem which implies strong N P-hardness for VNE even for very special subclasses of graphs and yields a strong inapproximability result for general graphs. We also consider the special cases obtained when fixing one of the dimensions of the problem to one. We show that VNE is still strongly N P-hard when a single virtual network request is present or when each virtual network request consists of a single virtual node and that it is weakly N P-hard for the case with a single physical node.