Please wait a minute...
FITEE
Front. Inform. Technol. Electron. Eng.  2011, Vol. 12 Issue (11): 910-918    DOI: 10.1631/jzus.C1100003
    
A new algorithm based on the proximity principle for the virtual network embedding problem
Jiang Liu, Tao Huang*, Jian-ya Chen, Yun-jie Liu
Key Laboratory of Universal Wireless Communications of Ministry of Education, Beijing University of Post and Telecommunications, Beijing 100876, China
A new algorithm based on the proximity principle for the virtual network embedding problem
Jiang Liu, Tao Huang*, Jian-ya Chen, Yun-jie Liu
Key Laboratory of Universal Wireless Communications of Ministry of Education, Beijing University of Post and Telecommunications, Beijing 100876, China
 全文: PDF(700 KB)  
摘要： 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.
关键词： Virtual network embedding;  Proximity;  Revenue/cost (R/C) ratio;  Acceptance ratio;  Runtime    
Abstract: 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.
Key words: Virtual network embedding    Proximity    Revenue/cost (R/C) ratio    Acceptance ratio    Runtime
收稿日期: 2011-01-01 出版日期: 2011-11-04
CLC:  TP393  
服务　　
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章　　
Jiang Liu
Tao Huang
Jian-ya Chen
Yun-jie Liu

引用本文:

Jiang Liu, Tao Huang, Jian-ya Chen, Yun-jie Liu. A new algorithm based on the proximity principle for the virtual network embedding problem. Front. Inform. Technol. Electron. Eng., 2011, 12(11): 910-918.

链接本文:

http://www.zjujournals.com/xueshu/fitee/CN/10.1631/jzus.C1100003    或    http://www.zjujournals.com/xueshu/fitee/CN/Y2011/V12/I11/910

[1] Bo Lu, Jian-ya Chen, Hong-yan Cui, Tao Huang, Yun-jie Liu. A virtual network mapping algorithm based on integer programming[J]. Front. Inform. Technol. Electron. Eng., 2013, 14(12): 899-908.
[2] Xiao-ling Li, Huai-min Wang, Chang-guo Guo, Bo Ding, Xiao-yong Li, Wen-qi Bi, Shuang Tan. Topology awareness algorithm for virtual network mapping[J]. Front. Inform. Technol. Electron. Eng., 2012, 13(3): 178-186.
[3] Bin Lin, Xiao-lang Yan, Zheng Shi, Yi-wei Yang. A sparse matrix model-based optical proximity correction algorithm with model-based mapping between segments and control sites[J]. Front. Inform. Technol. Electron. Eng., 2011, 12(5): 436-442.