Decomposition Approaches for Virtual Network Embedding With One-Shot Node and Link Mapping

Abstract

Network virtualization is a promising new resource management approach that allows customized virtual networks (VNs) to be multiplexed on a shared physical infrastructure. In this paper, our focus is on the embedding of VN resources onto this infrastructure. Since this problem is known to be NP-hard, embedding proposals in literature are heuristic-based approaches that restrict the problem space in different dimensions. Limitations of these proposals are: 1) as embedding of VN links and nodes is performed in two separate stages, it may ensue in a high blocking of VN requests and a less efficient usage of substrate resources; and 2) as pricing of embedding resources is based on linear functions, it triggers no competition among VN users in order to maximize infrastructure provider profits. These drawbacks motivate us to propose a mathematical model that makes use of large-scale optimization tools and proposes a Column Generation (CG) formulation of the problem, coupled with branch-and-bound technique or rounding-off heuristic. We also propose a periodical planning of embedding process where profitable VN requests are selected through an auction mechanism. In our experiments with different substrate network topologies and many different VN request patterns, we show a clear advantage of auction-based CG models over present benchmarks.

A Novel Optimal Mapping Algorithm With Less Computational Complexity for Virtual Network Embedding

“…Mijumbi et al [15], stimulating from [14], is another variation of [13] to solve the VNE problem. Constraints considered are same to what are considered in [13].…”

“…Though VNE exact algorithms enable to ensure an optimal or near-optimal embedding of each given VN in small-scaled network scenarios [9], the computational complexity are very large in a discrete time event [10][11][12], not to mention medium or largesized network scenario in a continuous time event. Other exactlike algorithms [13][14][15] have to relax integer constraints or use column generation approach to achieve a feasible VN embedding in limited time. Strictly speaking, these algorithms [13][14][15] belong to the heuristic category.…”

“…Other exactlike algorithms [13][14][15] have to relax integer constraints or use column generation approach to achieve a feasible VN embedding in limited time. Strictly speaking, these algorithms [13][14][15] belong to the heuristic category. Therefore, it is of great importance to develop heuristic algorithms.…”

Stochastic Planning for Content Delivery: Unveiling the Benefits of Network Functions Virtualization

“…VNE has received a lot of attention from the community, and several heuristic algorithms have been proposed, e.g. in [9]- [11].…”

“…Jarray et al propose in [9] a column-generation technique coupled with a rounding heuristic to discover the most profitable embedding, under the constrained physical capacity of the infrastructure. Deterministic and randomized rounding techniques are used by Chowdhury et al in [10], where they further facilitate the virtual link mapping by designing an augmented graph description to efficiently support node location constraints.…”