On the Hardness and Inapproximability of Virtual Network Embeddings

Abstract

Many resource allocation problems in the cloud can be described as a basic Virtual Network Embedding Problem (VNEP): the problem of finding a mapping of a request graph (describing a workload) onto a substrate graph (describing the physical infrastructure). Applications range from mapping testbeds, over the embedding of batch-processing tasks to the embedding of service function chains and come with different mapping restrictions for nodes and edges. The restrictions studied most often are node and edge capacities, node mapping, edge routing and latency restrictions. While the VNEP has been studied intensively, complexity results are only known for specific models and this paper provides a first comprehensive study of the computational complexity of the VNEP by systematically analyzing its hardness for any combination of the above stated mapping restrictions. For all studied variants the ${ {\mathcal {NP}}\text {-completeness}}$ of the respective decision problems is shown. Furthermore, ${ {\mathcal {NP}}\text {-completeness}}$ results for finding approximate embeddings, which may, e.g., violate capacity constraints by certain factors, are derived. Lastly, it is also shown that all these results pertain when restricting the request graphs to planar and degree-bounded graphs. While theoretic in nature, our results have severe practical implications. Firstly, any optimization variant of the VNEP is ${ {\mathcal {NP}}\text {-hard}}$ and cannot be approximated for any of the studied restrictions, unless ${ {\mathcal {P}}{\,=\,} {\mathcal {NP}}}$ . Secondly, we uncover structural hardness properties: the VNEP is ${ {\mathcal {NP}}\text {-hard}}$ and inapproximable even if, e.g., only node placement and edge routing restrictions are considered.