A virtual network mapping algorithm based on subgraph isomorphism detection

By Jens Lischka, Holger Karl. Virtualized Infrastructure Systems and Architectures, 2009

512 citations recorded by the source corpus.

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.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/f5db8ca339a05e76df64d4e1b8d1c8771b8aac73

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

QoS-Aware Deployment of IoT Applications Through the Fog (2017, methodology): “links similarly to the SIP solution of [13].”
SecondNet: a data center network virtualization architecture with bandwidth guarantees (2010, methodology): “For example, the algorithm in [ 24 ] needs 12 seconds to allocate a VDC with 8 VMs in an empty small BCube2 network with 512 servers.”
Virtual Network Embedding: A Survey (2013, methodology): “[44] Lischka and Karl (2009) Heuristic One Stage Provides one stage VNE.”