Efficient Online Virtual Network Mapping Using Resource Evaluation

Network virtualization is a promising solution that can prevent network ossification by allowing multiple heterogeneous virtual networks (VNs) to cohabit on a shared substrate network. It provides flexibility and promotes diversity. A key issue that needs to be addressed in network virtualization is allocation of substrate resources for the VNs with respect to their resource requirements and the topologies of the substrate and virtual networks, namely the VN mapping (VNM) problem. Efficient VNM algorithms aim to maximize the number of coexisting VNs, and increase the utilization and revenue obtained from the substrate resources. In this paper, we present an online VNM algorithm (OVNM) that maximizes the number of coexisting VNs leading to good utilization and revenue of the substrate. Using the OVNM algorithm, we estimate the VN mapping and evaluate the associatedsubstrate resources to map the VN within a proper region on the substrate by using the FVN_Sort (first virtual node sorting) function. This improves the probability of a VN mapping success. Furthermore, by mapping the virtual nodes and links in a coordinated fashion, the resource consumption while mapping is minimized. We evaluate the performance of our approach by using simulation, and show that the algorithm has an acceptable run time and leads to a better blocking probability performance, which means more coexisting VNs.