Talks and Poster Presentations (with Proceedings-Entry):
J. Inführ, G. Raidl:
"A memetic algorithm for the virtual network mapping problem";
Talk: Metaheuristics International Conference (MIC),
- 2013-08-08; in: "Proceedings of the 10th Metaheuristics International Conference",
Paper ID 28,
The Virtual Network Mapping Problem arises in the context of Future Internet research. The core
idea is the introduction of virtual networks to the Internet to be able to improve its functionality in
a non-disruptive way. This also enables the creation of specialized networks which directly provide
functionality required by some application classes. The challenge of fitting all the virtual networks
(and the resources they require) into a physical network is the Virtual Network Mapping Problem.
In this work, we introduce a Memetic Algorithm that significantly outperforms the previously best
algorithms for this problem. We also offer an analysis of the influence of different problem representations
and in particular the implementation of an uniform crossover for the Grouping Genetic
Algorithm that may also be interesting outside of the Virtual Network Mapping domain.
Electronic version of the publication:
Created from the Publication Database of the Vienna University of Technology.