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

查看全文 作　　者：Jiang LIU Tao HUANG Jian-ya CHEN Yun-jie [1]LIU

机构地区：[1]Key Laboratory of Universal Wireless Communications of Ministry of Education, Beijing University of Post and Telecommunications, Beijing 100876, China

出　　处：《Journal of Zhejiang University-Science C(Computers and Electronics)》索引2011年第12卷第11期,共9页

基　　金：supported by the National Basic Research Program (973) of China (Nos. 2007CB310701 and 2011CB302900);the National Science and Technology Major Projects (No. 2010ZX03004-002-02) 摘　　要：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. 关键词：虚拟网络嵌入最近收入 / 费用(R/C ) 比率接受比率运行时刻

相关文献

参考文献（13）
引证文献（15）
耦合文献（0）

参考文献(13)

引证文献(15)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

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

参考文献(13)

引证文献(15)

用户提示