中文摘要：

嵌入 / 印射问题的虚拟网络是网络虚拟化的一个核心问题。它主要担心怎么高效地印射虚拟网络请求到底层网络。处于这个问题有二步：节点印射并且连接印射。当前的研究主要集中于开发启发式的算法，自从两步是计算地难处理的。在这份报纸，我们基于最近原则建议一个新算法，它在印射步的节点除能力因素以外考虑距离因素。因此，嵌入的问题的二步能是更好综合的，底层网络资源能更高效地被使用。模拟结果证明新算法极大地提高收入 / 费用(R/C ) 的性能嵌入的问题的比率，接受比率，和运行时刻。

英文摘要：

The virtual network embedding/mapping problem is a core issue of network virtualization. It is concerned mainly with how to map virtual network requests to the substrate network efficiently. There are two steps in this problem： node mapping and link mapping. Current studies mainly focus on developing heuristic algorithms, since both steps are computationally intractable. In this paper, we propose a new algorithm based on the proximity principle, which considers the distance factor besides the capacity factor in the node mapping step. Thus, the two steps of the embedding problem can be better integrated and the substrate network resource can be used more efficiently. Simulation results show that the new algorithm greatly enhances the performance of the revenue/cost （R/C） ratio, acceptance ratio, and runtime of the embedding problem.