Hybrid Virtual Network Embedding with Time-oriented Scheduling Policy  

作　　者：LIAO Jianxin QING Nude WANG Jingyu ZHU Xiaomin WANG Jing 

机构地区：[1]State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China [2]Eastcom-BUPT Information Technology Company, Limited, Beijing 100191, China

出　　处：《Chinese Journal of Electronics》2013年第4期789-794,共6页电子学报（英文版）

基　　金：This work is supported by the National Basic Research Program of China （973 Program） （No.2013CB329102）, the National Natural Science Foundation of China （No.61271019, No.61101119, No.61121001, No.61072057, No.60902051）, and the Program for Changjiang Scholars and Innovative Research Team in University （No.IRT1049）.

摘　　要：Network virtualization provides a power- ful tool to allow multiple networks, each customized to a specific purpose, to run on a shared substrate. However, a big challenge is how to map multiple virtual networks onto specific nodes and links in the shared substrate network, known as virtual network embedding problem. Previous works in virtual network embedding can be decomposed to two classes： two-stage virtual network embedding and one- stage virtual network embedding. In this paper, by prun- ing the topology of virtual network using k-core decom- position, a hybrid virtual network embedding algorithm, with consideration of location constraints, is proposed to leverage the respective advantage of the two kinds of algo- rithm simultaneously in the mapping process. In addition, a time-oriented scheduling policy is introduced to improve the mapping performance. We conduct extensive simula- tions and the results show that the proposed algorithm has better performance in the long-term run.Network virtualization provides a power- ful tool to allow multiple networks, each customized to a specific purpose, to run on a shared substrate. However, a big challenge is how to map multiple virtual networks onto specific nodes and links in the shared substrate network, known as virtual network embedding problem. Previous works in virtual network embedding can be decomposed to two classes： two-stage virtual network embedding and one- stage virtual network embedding. In this paper, by prun- ing the topology of virtual network using k-core decom- position, a hybrid virtual network embedding algorithm, with consideration of location constraints, is proposed to leverage the respective advantage of the two kinds of algo- rithm simultaneously in the mapping process. In addition, a time-oriented scheduling policy is introduced to improve the mapping performance. We conduct extensive simula- tions and the results show that the proposed algorithm has better performance in the long-term run.

关 键 词：Network virtualization Virtual network embedding k-core decomposition Earliest-deadline-first scheduling. 

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