A new algorithm based on the proximity principle for the virtual network embedding problem  

作　　者：Jiang Liu Tao Huang Jian-ya Chen Yun-jie Liu 

出　　处：《Journal of Zhejiang University-Science C(Computers and Electronics)》2013年第12期908-908,共1页浙江大学学报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.

关 键 词：启发式算法 虚拟网络 嵌入问题 映射问题 网络嵌入 距离因子 网络资源 仿真结果 

分 类 号：TP393.1[自动化与计算机技术—计算机应用技术] O223[自动化与计算机技术—计算机科学与技术]