ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping

Fast and efficient network service embedding method with adaptive offloading to the edge

“…The second group, i.e., approaches that solve the VNE problem with heuristic algorithms, also shows a colorful palette of ideas. The authors of [5] propose a hybrid algorithm, which first solves the LP problem that is a relaxed version of the original ILP, then use deterministic and randomized rounding techniques on the solution to approximate the results of the original MIP. Other works perform the mapping in two steps: a node and an edge mapping stage.…”

Contributions to Efficient Resource Management in Virtual Networks

“…As shown in Fig. 1, for a given VN request, PaGe-VNE begins by obtaining an initial solution (composed of paths P 1 in an augmented substrate network [2]) to the primal problem using a VNE approach that performs node and link mapping in two coordinated stages. The coordination involves solving a mathematical program of the node mapping problem, which is biased by the virtual link demands and substrate link capacities, and then the use Dijkstra's shortest path algorithm [14] for the link mapping stage.…”

“…topology, node capacity and link bandwidth) reduces to the multi-way separator problem, which is known to be NP-Hard [2]. Therefore, several existing solutions that propose one-shot embedding such as [3] assume that all VN resource requirements are known a priori (offline case) and that the SN has unbounded resources, while others reduce the complexity further by assuming that the SN supports splitting of flows [4], and perform node and link embedding in two separate steps [5].…”

“…Therefore, several existing solutions that propose one-shot embedding such as [3] assume that all VN resource requirements are known a priori (offline case) and that the SN has unbounded resources, while others reduce the complexity further by assuming that the SN supports splitting of flows [4], and perform node and link embedding in two separate steps [5]. Even proposals that coordinate the two steps such as [2] still perform two separate embedding steps. Carrying out node and link embedding in two separate steps can lead to blocking or rejecting of resource requests at the link mapping stage and hence a sub-optimal substrate resource utilisation, which would negatively impact the revenue of InPs.…”

“…In addition, many current approaches [2]- [4] are static approaches (stop at the VNE step) without any considerations for possibilities of adjustments to the initial embedding, while those that propose dynamic solutions [8]- [11] do allocate a fixed amount of node and link resources to the VNs through out their life time. Overall, the number of dynamic solutions to VNE is limited [1].…”