HA-D3QN: Embedding virtual private cloud in cloud data centers with heuristic assisted deep reinforcement learning

被引:3
作者
Chen, Meng [1 ]
Hou, Jiaxin [1 ]
Sheng, Yongpan [1 ]
Wu, Yingbo [1 ,3 ]
Wang, Sen [1 ]
Lu, Jianyuan [2 ]
Fan, Qilin [1 ]
机构
[1] Chongqing Univ, Sch Big Data & Software Engn, Chongqing, Peoples R China
[2] Alibaba Grp, Hangzhou, Peoples R China
[3] Chongqing Univ, Software Engn Bldg 306, Chongqing, Peoples R China
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2023年 / 148卷
基金
中国国家自然科学基金;
关键词
Virtual network embedding; Virtual private cloud; Deep reinforcement learning; Cloud data center; Switching capacity; Guaranteed bandwidth; NETWORK; ALGORITHM;
D O I
10.1016/j.future.2023.05.025
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The virtual network embedding problem is embedding virtual networks (VNs) in a substrate network so that revenue or accept ratio is maximized. Previous study usually assumes disclosed communication demand among the virtual nodes in a VN, mismatching real-world cloud computing scenarios. In this paper, we propose a new VN abstraction based on the widely used Virtual Private Cloud model, where internal communication demand is unknown to cloud providers. In contrast with the majority of existing research, we allow the co-location of the virtual nodes belonging to the same VN, and introduce the concept of switching capacity for practical resource reservation. We categorize the substrate resources in cloud data centers into additive and non-additive for the first time, and devise our algorithms accordingly. After formulating the problem, we propose a solution framework named HA-D3QN (Heuristic Assisted Dueling Double Deep Q Network). Essentially, HA-D3QN selects the best responses to different system states by combining the D3QN deep reinforcement learning structure and the candidate actions, which are generated by our proposed heuristic algorithms for addressing the exponentially large action space. Finally, we conduct extensive simulation experiments, the results of which verify the effectiveness of our approach. & COPY; 2023 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 14
页数:14
相关论文
共 39 条
[11]  
Begin T., 2018, IEEE TRANS NETW SERV, V15
[12]  
Cao H., 2020, IEEE T IND INFORM, V16
[13]   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
[14]  
Chekuri C, 1999, PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P185
[15]  
Dehury C.K., 2019, IEEE JSAC, V37
[16]  
Dehury C.K., 2020, IEEE TRANS CLOUD COM
[17]   Efficient Virtual Network Embedding for Variable Size Virtual Machines in Fat-tree Data Centers [J].
Duan, Jun ;
Yang, Yuanyuan .
PROCEEDINGS 45TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING - ICPP 2016, 2016, :1-10
[18]   Improved Monte Carlo Tree Search for Virtual Network Embedding [J].
Elkael, Maxime ;
Castel-Taleb, Hind ;
Jouaber, Badii ;
Araldo, Andrea ;
Aba, Massinissa Ait .
PROCEEDINGS OF THE IEEE 46TH CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN 2021), 2021, :605-612
[19]  
Emmerich P, 2014, IEEE INT CONF CL NET, P120, DOI 10.1109/CloudNet.2014.6968979
[20]  
Fan W., 2021, IEEE T PARALL DISTR, V32