A Novel Optimal Mapping Algorithm With Less Computational Complexity for Virtual Network Embedding

Network virtualization (NV) is widely accepted as one enabling technology for future network, which enables multiple virtual networks (VNs) with different paradigms and protocols to coexist on the shared substrate network (SN). One key challenge in NV is VN embedding (VNE), which maps a VN onto the shared SN. Since VNE is NP-hard, existing efforts mainly focus on proposing heuristic algorithms that try to achieve feasible VNE in reasonable time, consequently the resulted embedding is not optimal. To tackle this difficulty, we propose a candidate assisted (CAN-A) optimal VNE algorithm with lower computational complexity. The key idea of the CAN-A algorithm lies in constructing the candidate substrate node subset and the candidate substrate path subset before embedding. This reduces the mapping execution time substantially without performance loss. In the following embedding, four types of node and link constraints are considered in the CAN-A algorithm, making it more applicable to realistic networks. Simulation results show that the execution time of CAN-A is hugely cut down compared with pure VNE-MIP algorithm. CAN-A also outperforms the typical heuristic algorithms in terms of other performance indices, such as the average VN request acceptance ratio and the average virtual link propagation delay.