Efficient virtual network embedding algorithm based on restrictive selection and optimization theory approach

Network virtualization (NV) is widely considered as a key component of the future network and promises to allow multiple virtual networks (VNs) with different protocols to coexist on a shared substrate network (SN). One main challenge in NV is virtual network embedding (VNE). VNE is a NP-hard problem. Previous VNE algorithms in the literature are mostly heuristic, while the remaining algorithms are exact. Heuristic algorithms aim to find a feasible embedding of each VN, not optimal or sub-optimal, in polynomial time. Though presenting the optimal or sub-optimal embedding per VN, exact algorithms are too time-consuming in small-scaled networks, not to mention moderately sized networks. To make a trade-off between the heuristic and the exact, this paper presents an effective algorithm, labeled as VNE-RSOT (Restrictive Selection and Optimization Theory), to solve the VNE problem. The VNE-RSOT can embed virtual nodes and links per VN simultaneously. The restrictive selection contributes to selecting candidate substrate nodes and paths and largely cuts down on the number of integer variables, used in the following optimization theory approach. The VNE-RSOT fights to minimize substrate resource consumption and accommodates more VNs. To highlight the efficiency of VNE-RSOT, a simulation against typical and state-of-art heuristic algorithms and a pure exact algorithm is made. Numerical results reveal that virtual network request (VNR) acceptance ratio of VNE-RSOT is, at least, 10% higher than the best-behaved heuristic. Other metrics, such as the execution time, are also plotted to emphasize and highlight the efficiency of VNE-RSOT.