DYVINE: Fitness-Based Dynamic Virtual Network Embedding in Cloud Computing

被引:47
作者
Dehury, Chinmaya Kumar [1 ]
Sahoo, Prasan Kumar [1 ,2 ]
机构
[1] Chang Gung Univ, Dept Comp Sci & Informat Engn, Taoyuan 333, Taiwan
[2] Chang Gung Mem Hosp, Div Colon & Rectal Surg, Taoyuan 33305, Taiwan
关键词
Cloud computing; virtual network embedding (VNE); dynamic VNE; virtual resource allocation; NODE-RANKING APPROACH; RESOURCE-MANAGEMENT; ALGORITHM; ALLOCATION; CLUSTERS; ONLINE;
D O I
10.1109/JSAC.2019.2906744
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Virtual network embedding (VNE) is the process of embedding the set of interconnected virtual machines onto the set of interconnected physical servers (PSs) in the cloud computing environment. The level of complexity of VNE problem increases when a large number of virtual machines with a set of resource demand need to be embedded onto a network of thousands of PSs. The key challenge of VNE is the efficient mapping of virtual networks (VNs), which may have dynamic resource demands. Existing solutions mainly emphasize on the embedding of static VN resulting in poor resource utilization and very low acceptance rate. To tackle such level of complexity in VNE, a fitness-based dynamic virtual network embedding (DYVINE) algorithm is proposed with the goal to maximize the resource utilization by maximizing the acceptance rate. Local and global fitness values of the virtual machines and VN, respectively, are used to utilize the maximum amount of physical resources. The proposed VNE algorithm allows the VN to be dynamic, which indicates that the structure and resource demand can he changed during its execution time. Furthermore, in order to reduce the embedding time in each time slot, a set of PSs is selected to host the VN instead of considering thousands of PSs, which may significantly increase the embedding time. The proposed embedding mechanism is evaluated through extensive simulation and is compared with similar existing embedding algorithms, which outperforms over others.
引用
收藏
页码:1029 / 1045
页数:17
相关论文
共 28 条
[1]   Adaptive Resource Allocation and Provisioning in Multi-Service Cloud Environments [J].
Alsarhan, Ayoub ;
Itradat, Awni ;
Al-Dubai, Ahmed Y. ;
Zomaya, Albert Y. ;
Min, Geyong .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2018, 29 (01) :31-42
[2]   Network-aware embedding of virtual machine clusters onto federated cloud infrastructure [J].
Aral, Atakan ;
Ovatman, Tolga .
JOURNAL OF SYSTEMS AND SOFTWARE, 2016, 120 :89-104
[3]   Secure virtual network embedding with flexible bandwidth-based revenue maximization [J].
Besiktas, Cihangir ;
Gozupek, Didem ;
Ulas, Aydin ;
Lokman, Erhan .
COMPUTER NETWORKS, 2017, 121 :89-99
[4]   Novel Node-Ranking Approach and Multiple Topology Attributes-Based Embedding Algorithm for Single-Domain Virtual Network Embedding [J].
Cao, Haotong ;
Yang, Longxiang ;
Zhu, Hongbo .
IEEE INTERNET OF THINGS JOURNAL, 2018, 5 (01) :108-120
[5]   A Efficient Mapping Algorithm With Novel Node-Ranking Approach for Embedding Virtual Networks [J].
Cao, Haotong ;
Zhu, Yongxu ;
Yang, Longxiang ;
Zheng, Gan .
IEEE ACCESS, 2017, 5 :22054-22066
[6]   Novel adaptive virtual network embedding algorithm for Cloud's private backbone network [J].
Fajjari, Ilhem ;
Aitsaadi, Nadjib ;
Dab, Boutheina ;
Pujolle, Guy .
COMPUTER COMMUNICATIONS, 2016, 84 :12-24
[7]   Novel Location-Constrained Virtual Network Embedding (LC-VNE) Algorithms Towards Integrated Node and Link Mapping [J].
Gong, Long ;
Jiang, Huihui ;
Wang, Yixiang ;
Zhu, Zuqing .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (06) :3648-3661
[8]   Virtual Network Embedding via Monte Carlo Tree Search [J].
Haeri, Soroush ;
Trajkovic, Ljiljana .
IEEE TRANSACTIONS ON CYBERNETICS, 2018, 48 (02) :510-521
[9]   Coordinated node and link mapping VNE using a new paths algebra strategy [J].
Hesselbach, Xavier ;
Amazonas, Jose Roberto ;
Villanueva, Santi ;
Felipe Botero, Juan .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2016, 69 :14-26
[10]   Embedding parallelizable virtual networks [J].
Liang, Yu ;
Zhang, Sheng .
COMPUTER COMMUNICATIONS, 2017, 102 :47-57