A virtual network embedding algorithm based on mapping tree

Network virtualization enables the co-existence of multiple virtual networks (VNs) on the same substrate network (SN) by sharing the available resources. Virtual network embedding (VNE) plays an important role in building virtual networks. In this paper, we propose a new virtual network mapping algorithm based on a mapping tree on nodes mapping phase. Mapping tree, converted from the virtual network, is a simplified topology of virtual network, which is used to describe the hierarchical relationships among the virtual nodes. In our algorithm, different virtual nodes in a mapping tree which are directly connected by virtual links should be mapped to the same substrate node as long as the node´s available resources can satisfy the total resource requirements of these virtual nodes. In link mapping phase, we use the k-shortest paths method. Simulation results show that the proposed scheme has a good performance in the acceptance ratio of virtual network requests, and the average revenue of substrate network.