A Heuristic Virtual Network Mapping Algorithm

Virtual Network Mapping Problem (VNMP) is one of the key problems in network virtualization, which is proved as a non-deterministic polynomial hard (NP-Hard) problem. Considering the relevance of nodes and links, a virtual network mapping algorithm based on biogeography optimization algorithm is proposed in this paper. In order to reduce the cost of the substrate network embedding, it is designed as a one-stage algorithm and solved with heuristic algorithm. The experimental results suggest that the proposed algorithm increases the average operating income of the virtual networks and reduces the cost of substrate network comparing with other two-stage mapping algorithms.