Virtual network mapping into heterogeneous substrate networks

Abstract

As the interest on Network Virtualization continues to grow, so does the awareness of the many technical obstacles to transpose before the envisioned virtualized network environment may become a reality. A significant obstacle lies on the efficient assignment of virtual resources into physical ones. Performing the so-called mapping of a virtual network into a substrate network is a computationally intensive task, due to the dual optimization required for nodes and links placement. The purpose of this paper is to tackle this problem taking into consideration real-life scenarios of network operators, where the limitations imposed by the heterogeneity of the virtual and substrate networks must be accounted for. To that end, this paper proposes a heuristic algorithm for virtual resources mapping in the physical infrastructure that supports the heterogeneity of networks, in both links and nodes. The mapping heuristic was evaluated both through simulation and in a real experimental virtualization platform. Through the simulation results, it is shown that the mapping approach is able to embed a high percentage of the Virtual Network (VNet) requests respecting all links and node constraints. With respect to the experimental results, the proposed algorithm was shown to be fast, requiring a mapping time in the order of low tens of milliseconds, and linearly scalable with the increase in the number of existing VNets.

A model for virtual network embedding using Artificial Bee Colony

“…Equation 8 formulates the fitness function which is the sum of the total cost of VN requests embedding on the SNs, managed by multiple InPs with an added penalty function for minimizing VNs embedding cost. α j signifies the cost for overloading the unit capacity of jth SN.…”

Virtual networks dependability assessment framework

“…The outcome of this level is single mapping (no redundancy) or passive replication mapping (passive mapping) or active replication mapping (active mapping) for the request (Lira et al, 2015). There are many VN mapping works (Chowdhury et al, 2012;Zhang et al, 2013;Nogueira et al, 2011;Yu et al, 2008;Cheng et al, 2011;Yeow et al, 2011) thus it is outside the scope of our work.…”

Virtual Network Embedding Algorithms Based on Best-Fit Subgraph Detection

“…Di et al (Di et al, 2010) improved performance and complexity of the proposed algorithm in (Lischka & Karl, 2009) by considering link mapping cost during the process of sorting nodes and choosing the maximal hop limit. Nogueira et al (Nogueira et al, 2011) proposed heuristic-based VN embedding algorithm to deal with the heterogeneity of VNs and SN, in both links and nodes. The proposed algorithm is one stage VNE algorithm.…”