A memetic algorithm for the virtual network mapping problem |
| |
Authors: | Email author" target="_blank">Johannes?InführEmail author Günther?Raidl |
| |
Institution: | 1.Algorithms and Data Structures Group,Vienna University of Technology,Vienna,Austria |
| |
Abstract: | The Internet has ossified. It has lost its capability to adapt as requirements change. A promising technique to solve this problem is the introduction of network virtualization. Instead of directly using a single physical network, working just well enough for a limited range of applications, multiple virtual networks are embedded on demand into the physical network, each of them perfectly adapted to a specific application class. The challenge lies in mapping the different virtual networks with all the resources they require into the available physical network, which is the core of 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 a uniform crossover for the grouping genetic algorithm that may also be interesting outside of the virtual network mapping domain. Furthermore, we study the influence of different hybridization techniques and the behaviour of the developed algorithm in an online setting. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|