Virtual Resource Allocation for Mobile Edge Computing: A Hypergraph Matching Approach

In this paper, the energy efficient virtual machine (VM) placement and virtual resource allocation problem for the mobile edge computing (MEC) system is explored. Particularly, we develop an optimization framework of energy consumption minimization for computing and offloading by jointly optimizing the VM placement matrix and the number of physical machines (PMs). To resolve this problem, we transform the optimization problem into a non-uniform weighted hypergraph model. In this model, the weight of hyperedge is defined as the negative of the accumulated energy consumption for computing at VM instances hosted by one PM. Based on the hypergraph model, a hypergraph matching algorithm by utilizing the local search policy is proposed for finding the maximum-weight subset of vertex-disjoint hyperedges, aiming to obtain an optimal VM placement, i.e., (M*)-perfect matching. Furthermore, the virtualized resources are further allocated to user equipments (UEs) in the form of multiple VM instances via the optimal VM placement to meet the requirement of workloads. Simulation results are presented to demonstrate the effectiveness of the proposed hypergraph matching algorithm over the alternative benchmark algorithm.