TY - JOUR
T1 - Gemma
T2 - Reinforcement Learning-Based Graph Embedding and Mapping for Virtual Network Applications
AU - Park, Minjae
AU - Lee, Youngseok
AU - Yeom, Ikjun
AU - Woo, Honguk
N1 - Publisher Copyright:
© 2013 IEEE.
PY - 2021
Y1 - 2021
N2 - Virtual network mapping (VNM) is a challenge in the field of network virtualization. As VNM variants have been formalized depending on substrate network structures, virtual network specifications, mapping optimization objectives, and other factors, a number of VNM heuristic methods have been introduced. On the other hand, reinforcement learning (RL) algorithms have been incorporated into deep learning frameworks and recognized as a promising solution for solving complex resource allocation problems. In this paper, we present an RL-based graph embedding and mapping framework, Gemma, for tackling various VNM problems in a unified end-to-end manner. In the framework, we employ an encoder-decoder deep learning architecture and propose several optimization schemes such as two-stage mapping and model-based selective embedding. Aiming to deal with large-scale VNM problems in both online and offline scheduling systems, the proposed schemes explore the trade-off between inference accuracy and mapping function runtimes, enhancing scalability and timeliness. Gemma shows robust performance under various problem conditions, outperforming other heuristic and learning-based methods.
AB - Virtual network mapping (VNM) is a challenge in the field of network virtualization. As VNM variants have been formalized depending on substrate network structures, virtual network specifications, mapping optimization objectives, and other factors, a number of VNM heuristic methods have been introduced. On the other hand, reinforcement learning (RL) algorithms have been incorporated into deep learning frameworks and recognized as a promising solution for solving complex resource allocation problems. In this paper, we present an RL-based graph embedding and mapping framework, Gemma, for tackling various VNM problems in a unified end-to-end manner. In the framework, we employ an encoder-decoder deep learning architecture and propose several optimization schemes such as two-stage mapping and model-based selective embedding. Aiming to deal with large-scale VNM problems in both online and offline scheduling systems, the proposed schemes explore the trade-off between inference accuracy and mapping function runtimes, enhancing scalability and timeliness. Gemma shows robust performance under various problem conditions, outperforming other heuristic and learning-based methods.
KW - graph convolution network
KW - Graph Embedding
KW - reinforcement learning
KW - virtual network embedding
KW - virtual network mapping
UR - https://www.scopus.com/pages/publications/85112598280
U2 - 10.1109/ACCESS.2021.3100283
DO - 10.1109/ACCESS.2021.3100283
M3 - Article
AN - SCOPUS:85112598280
SN - 2169-3536
VL - 9
SP - 105463
EP - 105476
JO - IEEE Access
JF - IEEE Access
M1 - 9496654
ER -