EPVNE: An Efficient Parallelizable Virtual Network Embedding Algorithm

Abstract

Virtual network embedding (VNE) problem is a key issue in network virtualization technology, and much attention has been paid to the virtual network embedding. However, very little research work focuses on parallelized virtual network embedding problems which assumes that the substrate infrastructure supports parallel computing and allows one virtual node to be mapped to multiple substrate nodes. Based on the work of Liang and Zhang, we extend the well-known VNE to parallelizable virtual network embedding (PVNE) in this paper. Furthermore, to the best of our knowledge, we give the first formulation of the PVNE problem. A new heuristic algorithm named efficient parallelizable virtual network embedding (EPVNE) is proposed to reduce the cost of embedding the VN request and increase the VN request acceptance ratio. EPVNE is a two-stage mapping algorithm, which first performs node mapping and then performs link mapping. In the node mapping phase, we present a simple and efficient virtual node and physical node sorting formula and perform the virtual node mapping in order. When mapping virtual nodes, we map virtual nodes to physical nodes that just meet the CPU requirements. Substrate nodes with more CPU resources will be retained for subsequent virtual network mapping requests. In the link mapping phase, Dijkstra’s algorithm is used to find a substrate path for each virtual link. Finally, simulations are carried out and simulation results show that our algorithm performs better than the existing heuristic algorithms.

Gemma: Reinforcement Learning-Based Graph Embedding and Mapping for Virtual Network Applications

“…Each task request of network packet processing can be represented in a DAG. This is a common VNM configuration (e.g., network function virtualization) in which the VNM performance improves as the number of virtual networks accepted (allocated) by the underlying substrate network at the ISP increases [19]. To maximize the acceptance rate, our model learns to efficiently allocate resources between networks.…”

“…Throughout this paper, we call these representative VNM problems DCNet and ISP. Note that DCNet can be also referred to as an online problem and ISP as an offline problem with regard to the taxonomy of conventional task scheduling and resource allocation approaches [19].…”

Novel Node-Ranking Approach for SDN-Based Virtual Network Embedding

“…e VNE-RCR and VNE-NRM algorithms have the lowest longterm average R/C ratio. e reason is that the virtual nodes [2,10], uniform distributed Node computing capability demand [10,30], uniform distributed Node flow rule capacity demand [10,30], uniform distributed Link bandwidth demand [10,30], uniform distributed Virtual node location constraint D(n i ) � 500 [36] Virtual node embedding based on resource and topology attributes metrics VNE-NRM [37] Virtual node embedding based on resource importance metric VNE-RCR [37] Virtual node embedding based on resource balance metric are far away after embedding onto the substrate network. us, it leads to large amount of unnecessary bandwidth resources consumption.…”

“…However, the ossification of Internet is getting worse with the rapid growth of end-users and various applications. Inspired by the success of virtualization technology in the field of computing [1], network virtualization (NV) [2] allows multiple heterogeneous virtual networks (VNs) to run on a shared substrate network (SN) simultaneously [3] and is gradually becoming an important research topic in academia and industry recently.…”

“…VNE is a process of embedding the virtual network requests (VNRs) onto the shared SN infrastructures, with the constraints of nodes (e.g., node computing capacity and node location) and links (link bandwidth). is makes the VNE be an NP-hard problem [2]; hence, a considerable volume of algorithms has been proposed to solve the VNE problem.…”