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.
Highlights
As we all know, the Internet has become one of the infrastructures of today’s social communications, information exchange, economic and commercial operations, and multimedia services [1]. e existing Internet architecture has played an important role in promoting the rapid development of the Internet
Each virtual network is a piece of resources of the underlying physical network, which consists of virtual nodes and virtual links [6]
In order to cope with the dynamic resource requirements, a fitness-based dynamic virtual network embedding (DYVINE) algorithm is proposed with the goal to maximize the resource utilization by maximizing the acceptance rate [42]
Summary
The Internet has become one of the infrastructures of today’s social communications, information exchange, economic and commercial operations, and multimedia services [1]. e existing Internet architecture has played an important role in promoting the rapid development of the Internet. In the parallelizable virtual network embedding (PVNE) environment, a virtual node could be mapped into multiple substrate nodes. If parallelization is not supported, this request would be rejected, as there is no substrate node that has more than 50 units of available CPU resources which the virtual node d requires. No physical node can satisfy the resource requirements of the virtual node d In this case, a parallelized mapping scheme is required; that is, a virtual node is mapped to multiple substrate nodes. (i) Based on optimization theory and resource integration technology, an optimized mathematical model for parallel virtual network embedding is proposed. Substrate nodes with more CPU resources will be retained for subsequent virtual network mapping requests.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
