Virtual network mapping onto substrate networks

Author(s)

Gustavo Prado Alkmim

• Document type: Master's Dissertation
• Press: Campinas, SP.
• Institution: Universidade Estadual de Campinas (UNICAMP). Instituto de Computação
• Defense date: 2012-06-26

Examining board members

Nelson Luis Saldanha da Fonseca; Edmundo Roberto Mauro Madeira; Luciano Paschoal Gaspary

• Advisor: Nelson Luis Saldanha da Fonseca

Abstract

Network virtualization is a promising technology to be employed in the future Internet, since it allows the introduction of new functionalities in network elements at low cost. One of the open questions in network virtualization is how to perform an efficient mapping of virtual networks in the substrate, which is NP-Hard problem. Existing solutions in the literature ignore several characteristics of real-world environments in order to solve the problem in a reasonable time frame. This paper introduces eight algorithms to solve the mapping problem that are based on 0-1 integer linear programming. One of the main contribution is the consideration of realistic assumptions to the problem that are not considered by others in the literature. Six algorithms minimize the allocated bandwidth and the two others minimize the power consumption in the substrate. The proposed approximative algorithms can map virtual networks in large substrates in few seconds and they find accurate solutions, which make them adequate to be employed in real-time admission control (AU)

• FAPESP's process: 10/03422-5 - Virtual Network Mapping on Network Substrate
• Grantee: Gustavo Prado Alkmim
• Support Opportunities: Scholarships in Brazil - Master