A memetic algorithm for the virtual network mapping problem

被引:13
作者
Infuehr, Johannes [1 ]
Raidl, Guenther [1 ]
机构
[1] Vienna Univ Technol, Algorithms & Data Struct Grp, Favoritenstr 9-11-1861, A-1040 Vienna, Austria
关键词
Virtual network mapping; Memetic algorithm; Hybrid metaheuristic; Grouping genetic algorithm;
D O I
10.1007/s10732-014-9274-x
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:475 / 505
页数:31
相关论文
共 43 条
[1]  
Alonso-Garrido O, 2009, LECT NOTES COMPUT SC, V5788, P376, DOI 10.1007/978-3-642-04394-9_46
[2]   Overcoming the Internet impasse through virtualization [J].
Anderson, T ;
Peterson, L ;
Shenker, S ;
Turner, J .
COMPUTER, 2005, 38 (04) :34-+
[3]  
[Anonymous], ISITR2003570
[4]  
[Anonymous], INFORM SPEKTRUM
[5]  
[Anonymous], VIRTUAL NETWORK MAPP
[6]  
[Anonymous], GLOB TELECOMM CONF
[7]  
[Anonymous], LOOK FENC NETW
[8]  
[Anonymous], TECH REP
[9]  
[Anonymous], 2475 RFC
[10]  
[Anonymous], P 10 MET INT C SING