Cost efficient virtual infrastructure mapping using subgraph isomorphism

Network virtualization is a promising solution that can offer more flexibility and prevent Internet ossification without requiring extensive network redesign. Using virtualization multiple heterogeneous virtual network (VN) architectures can cohabit on a shared physical network substrate. Virtualization can be used to run multiple different applications (e.g., operating systems, servers, networking protocols) and also provide customized services suited to the customers needs. VN mapping (VNM) where virtual links and nodes are mapped/assigned to the substrate links and nodes is the key resource allocation problem in network virtualization. Recently the work in [1,3,4,5] have focused on VNM problem. In this paper, we improve on the vnmFlib algorithm [1] by using a new sorting algorithm and choosing the maximal hop limit to improve the mapping performance and compuation efficiency.