An Exact Virtual Network Embedding Algorithm Based on Integer Linear Programming for Virtual Network Request with Location Constraint

摘要

Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area.Virtual network embedding(VNE) is a key issue in network virtualization.VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years.However,the constraints of exact VNE are only node capacity and link bandwidth.Based on these,this paper presents an exact VNE algorithm,ILP-LC,which is based on Integer Linear Programming(ILP),for embedding virtual network request with location constraints.This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model.Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio,at least 15％.