Virtual network mapping in cloud computing: A graph pattern matching approach

Virtual network mapping (VNM) is to build a network on demand by deploying virtual machines in a substrate network, subject to constraints on capacity, bandwidth and latency. It is critical to data centers for coping with dynamic cloud workloads. This paper shows that VNM can be approached by graph pattern matching, a well-studied database topic. (i) We propose to model a virtual network request as a graph pattern carrying various constraints, and treat a substrate network as a graph in which nodes and edges bear attributes specifying their capacity. (ii) We show that a variety of mapping requirements can be expressed in this model, such as virtual machine placement, network embedding and priority mapping. (iii) In this model, we formulate VNM and its optimization problem with a mapping cost function. We establish complexity bounds of these problems for various mapping constraints, ranging from polynomial time to NP-complete. For intractable problems, we show that their optimization problems are approximation-hard, i.e. NPO-complete in general and APX-hard even for special cases. (iv) We also develop heuristic algorithms for priority mapping, an intractable problem. (v) We experimentally verify that our algorithms are efficient and are able to find high-quality mappings, using real-life and synthetic data.