Hypergraph Matching Based Efficient Virtual Network Embedding Algorithm for Data Centers

With the rapid development of data centers, the problem of high energy consumption has become more and more serious. By using the virtual network embedding technology, a large number of virtual resources can be merged into a small number of physical resources to reduce energy consumption. This paper proposes an efficient virtual network embedding algorithm based on hyper-graph matching for data centers. Firstly, the virtual network embedding system model is presented, and the optimization problem of minimizing energy consumption is established. Then, the system model is transformed into a weighted hypergraph model. The problem of minimum energy consumption of virtual network embedding becomes a problem of finding a perfect matching with the maximum total weight in the hypergraph, which is NP-Hard. In this paper, the low-complexity heuristic algorithms are investigated. The simulation results show that the proposed algorithm outperforms the bin packing algorithm and can effectively reduce the total energy consumption of the data center in the scenario of computation-intensive tasks.