On the Use of Graph Neural Networks for Virtual Network Embedding

Resource allocation of 5G network slices is one of the most important challenges for network operators. It can be formulated using the Virtual Network Embedding (VNE) problem, which was and remains an active field of studies, also known because of its NP-hardness. Owing to its complexity, several heuristics, meta-heuristics and Deep Learning-based solutions have been proposed. However, these solutions are inefficient either due to their slowness or to not taking into account the structure of data which results in an inefficient exploration of the solutions space. To overcome these issues, in this work we unveil the potential of Graph Convolutional Neural (GCN) networks and Deep Reinforcement Learning techniques in solving the VNE problem. The key point of our approach is modeling of the VNE problem as an episodic Markov Decision Process which is solved in a Reinforcement Learning fashion using a GCN-based neural architecture. The simulation results highlight the efficiency of our approach through an increased performance over time, while outperforming state-of-art solutions in terms of the services’ acceptance ratio.

[1]  Max Welling,et al.  Semi-Supervised Classification with Graph Convolutional Networks , 2016, ICLR.

[2]  Tarik Taleb,et al.  Network Slicing and Softwarization: A Survey on Principles, Enabling Technologies, and Solutions , 2018, IEEE Communications Surveys & Tutorials.

[3]  Pietro Liò,et al.  Graph Attention Networks , 2017, ICLR.

[4]  Bo Yi,et al.  A comprehensive survey of Network Function Virtualization , 2018, Comput. Networks.

[5]  Biswanath Mukherjee,et al.  A Scalable Approach for Service Chain Mapping With Multiple SC Instances in a Wide-Area Network , 2017, IEEE Journal on Selected Areas in Communications.

[6]  Alex Graves,et al.  Asynchronous Methods for Deep Reinforcement Learning , 2016, ICML.

[7]  John N. Tsitsiklis,et al.  Actor-Critic Algorithms , 1999, NIPS.

[8]  Marouen Mechtri,et al.  A Scalable Algorithm for the Placement of Service Function Chains , 2016, IEEE Transactions on Network and Service Management.

[9]  Jure Leskovec,et al.  GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models , 2018, ICML.

[10]  Jimmy Ba,et al.  Adam: A Method for Stochastic Optimization , 2014, ICLR.

[11]  Danqi Chen,et al.  Reasoning With Neural Tensor Networks for Knowledge Base Completion , 2013, NIPS.

[12]  Djamal Zeghlache,et al.  A multi-objective non-dominated sorting genetic algorithm for VNF chains placement , 2018, 2018 15th IEEE Annual Consumer Communications & Networking Conference (CCNC).

[13]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[14]  Yizhou Sun,et al.  SimGNN: A Neural Network Approach to Fast Graph Similarity Computation , 2018, WSDM.

[15]  Chi Harold Liu,et al.  Experience-driven Networking: A Deep Reinforcement Learning based Approach , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications.

[16]  Ah Chung Tsoi,et al.  The Graph Neural Network Model , 2009, IEEE Transactions on Neural Networks.

[17]  Bikash Koley The Zero Touch Network , 2016 .

[18]  Soroush Haeri,et al.  Virtual Network Embedding via Monte Carlo Tree Search , 2018, IEEE Transactions on Cybernetics.