DocumentCode :
2378683
Title :
Approximated algorithms for mapping virtual networks on network substrates
Author :
Alkmim, Gustavo P. ; Batista, Daniel M. ; Fonseca, Nelson L S da
Author_Institution :
Inst. of Comput., State Univ. of Campinas, Campinas, Brazil
fYear :
2012
fDate :
10-15 June 2012
Firstpage :
1460
Lastpage :
1465
Abstract :
Network virtualization is a promising technique for building the Internet of the future since it enables the introduction of new features into network elements at low cost. An open issue in virtualization is how to search for an efficient mapping of virtual network elements onto those of the existing physical network. Mapping is an NP-hard problem and existing solutions take long time to find a solution. This paper presents four new approximated algorithms based on two integer linear programming formulations that runs fast and, also, consider various real network characteristics, which is neglected by other proposals in the literature.
Keywords :
Internet; computational complexity; optimisation; virtual private networks; Internet; NP-hard problem; approximated algorithms; integer linear programming; network elements; network substrates; network virtualization; physical network; virtual network mapping; Approximation algorithms; Bandwidth; Delay; Internet; Optimized production technology; Routing protocols; Substrates;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications (ICC), 2012 IEEE International Conference on
Conference_Location :
Ottawa, ON
ISSN :
1550-3607
Print_ISBN :
978-1-4577-2052-9
Electronic_ISBN :
1550-3607
Type :
conf
DOI :
10.1109/ICC.2012.6364428
Filename :
6364428
Link To Document :
بازگشت