New algorithm for hub-and-spoke topological virtual networks embedding problem

被引:3
|
作者
Liu, Jiang [1 ]
Huang, Tao [1 ]
Chen, Jian-Ya [1 ]
Liu, Yun-Jie [1 ]
Lü, Bo [1 ]
机构
[1] Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China
基金
中央高校基本科研业务费专项资金资助;
关键词
Network embeddings - Heuristic algorithms;
D O I
10.1016/S1005-8885(11)60228-8
中图分类号
学科分类号
摘要
The virtual network embedding/mapping problem is a core issue of the network virtualization. It's mainly concerned with how to map virtual network requests to the substrate network efficiently. Previous researches mainly focus on developing heuristic algorithms for general topology virtual network request. In this paper, we propose a new algorithm for the hub-and-spoke (HAS) topology virtual request. The characters of the HAS topology are exploited to develop the new algorithm. The simulation results show that the new algorithm greatly enhances the performance of revenue/cost (R/C) ratio while the HAS topology request arrives. © 2012 The Journal of China Universities of Posts and Telecommunications.
引用
收藏
页码:55 / 61
相关论文
共 50 条