J. Inführ, G. Raidl:

"Solving the virtual network mapping problem with construction heuristics, local search and variable neighborhood descent";

Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Wien; 2013-04-03 - 2013-04-05; in: "Evolutionary Computation in Combinatorial Optimisation - 13th European Conference, EvoCOP 2013", Lecture Notes in Computer Science, Volume 7832 (2013), ISBN: 978-3-642-37197-4; 250 - 261.

The Virtual Network Mapping Problem arises in the context

of Future Internet research. Multiple virtual networks with di erent

characteristics are de ned to suit speci c applications. These virtual networks,

with all of the resources they require, need to be realized in one

physical network in a most cost e ective way. Two properties make this

problem challenging: Already nding any valid mapping of all virtual

networks into the physical network without exceeding the resource capacities

is NP-hard, and the problem consists of two strongly dependent

stages as the implementation of a virtual network's connections can only

be decided once the locations of the virtual nodes in the physical network

are xed. In this work we introduce various construction heuristics, Local

Search and Variable Neighborhood Descent approaches and perform an

extensive computational study to evaluate the strengths and weaknesses

of each proposed solution method.

http://publik.tuwien.ac.at/files/PubDat_223167.pdf

Created from the Publication Database of the Vienna University of Technology.