Coordinated node and link mapping VNE using a new paths algebra strategy. (July 2016)

• Record Type: Journal Article
• Authors: Hesselbach, Xavier; Amazonas, Josè Roberto; Villanueva, Santi; Botero, Juan Felipe
• Is Part Of: Journal of network and computer applications. Volume 69(2016)
• Page Start: 14
• Page End: 26
• Publication Date: 2016-07
• Subjects: Network virtualization -- Virtual network embedding -- Multi-constraint routing -- Paths algebra; Microcomputers -- Periodicals; Computer networks -- Periodicals; Application software -- Periodicals; Micro-ordinateurs -- Périodiques; Réseaux d'ordinateurs -- Périodiques; Logiciels d'application -- Périodiques; Application software; Computer networks; Microcomputers; Periodicals; 004.05; 004
• DOI: 10.1016/j.jnca.2016.02.025
• Languages: English
• ISSNs: 1084-8045

Abstract

Abstract: The main resource allocation research challenge in network virtualization is the Virtual Network Embedding (VNE) Problem. It consists of two stages, usually performed separately: node mapping and link mapping. A new mathematical multi-constraint routing framework for linear and non-linear metrics called "paths algebra" has already been proposed to solve the second stage, providing good results thanks to its flexibility. Unlike existing approaches, paths algebra is able to include any kind of network parameters (linear and non-linear) to solve VNE in reasonable runtime. While paths algebra had only been used to solve one stage (link mapping) of the VNE, this paper suggests an improvement to solve VNE using the paths algebra-based strategy by coordinating, in a single stage, the mapping of nodes and links based on a ranking made of the bi-directional pair of nodes of the substrate network, ordered by their available resources. Simulation results show that the New Paths Algebra-based strategy shows significant performance improvements when compared against the uncoordinated paths Algebra-based link mapping approach.