Effective virtual network embedding algorithm can increase network revenue and reduce the consumption of physical resources. If a virtual network can be meet the mapping, it is fixed for the consumption of physical node source, the sum of resource consumption depends on the paths embedded by virtual links. In order to reduce the link resource consumption, virtual nodes connecting directly to each other should be adjacent when mapped onto the substrate network. The paper proposes an algorithm based on topology convergence degree meeting link constraints. The algorithm considers the link constraint between nodes when computing nodes convergence degree. It belongs to one stage mapping algorithm. In addition, virtual nodes are ranked through the Breadth First Search of graph, so the virtual nodes mapped continuously have high correlation. Simulation results show that, the proposed algorithm improves the long term revenue and revenue/cost (R/C) ratio.
