A novel reinforcement learning algorithm for virtual network embedding

Network virtualization enables the share of a physical network among multiple virtual networks. Virtual network embedding determines the effectiveness of utilization of network resources. Traditional heuristic mapping algorithms follow static procedures, thus cannot be optimized automatically, leadi...

Full description

Saved in:
Bibliographic Details
Published in:Neurocomputing (Amsterdam) Vol. 284; pp. 1 - 9
Main Authors: Yao, Haipeng, Chen, Xu, Li, Maozhen, Zhang, Peiying, Wang, Luyao
Format: Journal Article
Language:English
Published: Elsevier B.V 05.04.2018
Subjects:
Policy gradient
Policy network
Reinforcement learning
Virtual network embedding
Policy gradient
Policy network
Reinforcement learning
Virtual network embedding
ISSN:0925-2312, 1872-8286
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Network virtualization enables the share of a physical network among multiple virtual networks. Virtual network embedding determines the effectiveness of utilization of network resources. Traditional heuristic mapping algorithms follow static procedures, thus cannot be optimized automatically, leading to sub-optimal ranking and embedding decisions. To solve this problem, we introduce a reinforcement learning method to virtual network embedding. In this paper, we design and implement a policy network based on reinforcement learning to make node mapping decisions. We use policy gradient to achieve optimization automatically by training the policy network with the historical data based on virtual network requests. To the best of our knowledge, this work is the first to utilize historical requests data to optimize network embedding automatically. The performance of the proposed embedding algorithm is evaluated in comparison with two other algorithms which use artificial rules based on node ranking. Simulation results show that our reinforcement learning is able to learn from historical requests and outperforms the other two embedding algorithms.
ISSN:0925-2312
1872-8286
DOI:10.1016/j.neucom.2018.01.025