A single-player Monte Carlo tree search method combined with node importance for virtual network embedding

Zheng, G, Wang, C, Shao, W, Yuan, Y, Tian, Z, Peng, S, Bashir, AK and Mumtaz, S (2021) A single-player Monte Carlo tree search method combined with node importance for virtual network embedding. Annales des Telecommunications/Annals of Telecommunications, 76 (5-6). pp. 297-312. ISSN 0003-4347

Preview

Accepted Version Available under License In Copyright. Download (427kB) | Preview

Abstract

© 2020, Institut Mines-Télécom and Springer Nature Switzerland AG. As a critical technology in network virtualization, virtual network embedding (VNE) focuses on how to allocate physical resources to virtual network requests efficiently. Because the VNE problem is NP-hard, most of the existing approaches are heuristic-based algorithms that tend to converge to a local optimal solution and have a low performance. In this paper, we propose an algorithm that combines the basic Monte Carlo tree search (MCTS) method with node importance to apply domain-specific knowledge. For a virtual network request, we first model the embedding process as a finite Markov decision process (MDP), where each virtual node is embedded in one state in the order of node importance that we design. The shortest-path algorithm is then applied to embed links in the terminal state and return the cost as a part of the reward. Due to the reward delay mechanism of the MDP, the result of link mapping can affect the action selected in the previous node mapping stage, coordinating the two embedding stages. With node importance, domain-specific knowledge can be used in the Expansion and Simulation stages of MCTS to speed up the search and estimate the simulation value more accurately. The experimental results show that, compared with the existing classic algorithms, our proposed algorithm can improve the performance of VNE in terms of the average physical node utilization ratio, acceptance ratio, and long-term revenue to cost ratio.