DocumentCode
3520163
Title
Algorithms for selection and allocation of virtual network requests
Author
da Silva, Igor R. M. ; Xavier, Eduardo C. ; da Fonseca, Nelson L. S.
Author_Institution
Inst. of Comput., State Univ. of Campinas, Campinas, Brazil
fYear
2013
fDate
24-26 Nov. 2013
Firstpage
1
Lastpage
6
Abstract
In recent years Network Virtualization has gained considerable attention from the scientific community once it provides mechanisms to overcome the ossification problem of the current Internet architecture. One of the main problems regarding Network Virtualization is the Network Embedding Problem, since it is a NP-Hard problem. In this work we present a new embedding algorithm based on the Tabu Search Metaheuristic and propose a VN selection policy based on the Bidimensional Knapsack Problem.
Keywords
Internet; integer programming; search problems; virtualisation; Bidimensional Knapsack problem; Internet architecture; NP-hard problem; Tabu search metaheuristic; VN selection policy; network embedding problem; network virtualization; ossification problem; virtual network requests; Algorithm design and analysis; Bandwidth; Linear programming; Resource management; Routing protocols; Search problems; Substrates;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications (LATINCOM), 2013 IEEE Latin-America Conference on
Conference_Location
Santiago
Print_ISBN
978-1-4799-1146-2
Type
conf
DOI
10.1109/LatinCom.2013.6759806
Filename
6759806
Link To Document