| Texto completo | |
| Autor(es): |
Alkmim, Gustavo P.
;
Batista, Daniel M.
;
da Fonseca, Nelson L. S.
Número total de Autores: 3
|
| Tipo de documento: | Artigo Científico |
| Fonte: | JOURNAL OF INTERNET SERVICES AND APPLICATIONS; v. 4, p. 15-pg., 2013-01-01. |
| Resumo | |
Network virtualization is a promising technique for building the Internet of the future since it enables the low cost introduction of new features into network elements. An open issue in such virtualization is how to effect an efficient mapping of virtual network elements onto those of the existing physical network, also called the substrate network. Mapping is an NP-hard problem and existing solutions ignore various real network characteristics in order to solve the problem in a reasonable time frame. This paper introduces new algorithms to solve this problem based on 0-1 integer linear programming, algorithms based on a whole new set of network parameters not taken into account by previous proposals. Approximative algorithms proposed here allow the mapping of virtual networks on large network substrates. Simulation experiments give evidence of the efficiency of the proposed algorithms. (AU) | |
| Processo FAPESP: | 10/03422-5 - Mapeamento de Redes Virtuais em Substratos de Redes |
| Beneficiário: | Gustavo Prado Alkmim |
| Modalidade de apoio: | Bolsas no Brasil - Mestrado |