A memetic algorithm for the virtual network mapping problem

被引:0
作者
Johannes Inführ
Günther Raidl
机构
[1] Vienna University of Technology,Algorithms and Data Structures Group
来源
Journal of Heuristics | 2016年 / 22卷
关键词
Virtual network mapping; Memetic algorithm; Hybrid metaheuristic; Grouping genetic algorithm;
D O I
暂无
中图分类号
学科分类号
摘要
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
页数:30
相关论文
共 35 条
[1]  
Anderson T(2005)Overcoming the internet impasse through virtualization Computer 38 34-41
[2]  
Peterson L(2010)Virtualisierung im future internet Informatik-Spektrum 33 186-194
[3]  
Shenker S(2003)Impact of the replacement heuristic in a grouping genetic algorithm Comput. Oper. Res. 30 1575-1593
[4]  
Turner J(2010)A survey of network virtualization Comput. Netw. 54 862-876
[5]  
Berl A(2003)PlanetLab: an overlay testbed for broad-coverage services ACM SIGCOMM Comput. Commun. Rev. 33 3-12
[6]  
Fischer A(2007)A grouping genetic algorithm for the multiple traveling salesperson problem Int. J. Inf. Technol. Decis. Mak. 6 333-347
[7]  
de Meer H(2001)Variable neighborhood search: principles and applications Eur. J. Oper. Res. 130 449-467
[8]  
Brown EC(1999)Genetic algorithms for the travelling salesman problem: a review of representations and operators Artif. Intell. Rev. 13 129-170
[9]  
Sumichrast RT(2003)A solver for the network testbed mapping problem Spec. Interest Group Data Commun. Comput. Commun. Rev. 33 65-81
[10]  
Chowdhury NMMK(2009)Towards the future internet: virtual networks for convergent services e & i Elektrotechnik und Informationstechnik 126 250-259