A virtual network mapping algorithm based on subgraph isomorphism detection

Assigning the resources of a virtual network to the components of a physical network, called Virtual Network Mapping, plays a central role in network virtualization. Existing approaches use classical heuristics like simulated annealing or attempt a two stage solution by solving the node mapping in a first stage and doing the link mapping in a second stage. The contribution of this paper is a Virtual Network Mapping (VNM) algorithm based on subgraph isomorphism detection: it maps nodes and links during the same stage. Our experimental evaluations show that this method results in better mappings and is faster than the two stage approach, especially for large virtual networks with high resource consumption which are hard to map. Categories and Subject Descriptors C2.5 [Computer-Communication Networks]: Local and

• Type: Conference
• Year: 2009
• Where: SIGCOMM
• Authors: Jens Lischka, Holger Karl
• Keywords: Communications, SIGCOMM 2009, Virtual Network Mapping, Virtual Networks, first Stage