An Efficient VNE Algorithm via Preferentially Mapping Important Nodes

摘要

Virtual Network Embedding (VNE) is one of the most challenging problems to realize network virtualization. In this paper, we propose that the method of sequencing virtual nodes can affect VNE algorithms' efficiency. Then we propose a novel strategy to coordinate the node embedding and link embedding. Based on the semi-local centrality measure used in social network, our strategy can present the importance of node. It can be declared as the sum of a virtual node's resource capacity and its neighbor nodes' resources capacities (SR). Furthermore, we design an efficient heuristic VNE algorithm, which is called SR-VNE. Extensive simulation experiments show that the proposed SR-VNE algorithm more effectively improves the time-average revenue as well as the acceptance ratio compared to the existing VNE algorithms.