A new algorithm with coordinated node and link mapping for virtual network embedding based on LP relaxation

Abstract

Network virtualization is an important technique for designing the future Internet architecture. Virtualization can help diversify the Internet by supporting multiple virtual network services and architectures on a shared substrate. Making efficient use of the underlying substrate network resources requires effective algorithms for virtual network embedding (VNE) that maps each virtual network (VN) to specific nodes and links in the substrate network. Two main types of algorithms have been applied to the VNE problem. One is heuristic-based algorithms, which focus primarily on link mapping after employing greedy methods to preselect the node mappings without considering its relation to the link mapping stage; the other is algorithms with coordination between the two phases. The work in took account of the coordination of two stages, and proposed a mixed integer program (MIP) formulation to solve the node mapping and link mapping problem simultaneously, and further developed two algorithms D-ViNE and R-ViNE based on LP relaxation.