# Optimal Virtual Network Embeddings for Tree Topologies

@article{Figiel2021OptimalVN, title={Optimal Virtual Network Embeddings for Tree Topologies}, author={Aleksander Figiel and Leon Kellerhals and R. Niedermeier and Matthias Rost and S. Schmid and P. Zschoche}, journal={Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures}, year={2021} }

The performance of distributed and data-centric applications often critically depends on the interconnecting network. Applications are hence modeled as virtual networks, also accounting for resource demands on links. At the heart of provisioning such virtual networks lies the NP-hard Virtual Network Embedding Problem (VNEP): how to jointly map the virtual nodes and links onto a physical substrate network at minimum cost while obeying capacities. This paper studies the VNEP in the light of… Expand

#### References

SHOWING 1-10 OF 37 REFERENCES

On the computational complexity of the virtual network embedding problem

- Mathematics, Computer Science
- Electron. Notes Discret. Math.
- 2016

This work presents a polynomial-time reduction from the maximum stable set problem which implies strong NP-hardness for VNE even for very special subclasses of graphs and yields a strong inapproximability result for general graphs. Expand

Virtual Network Embedding Approximations: Leveraging Randomized Rounding

- Computer Science
- 2018 IFIP Networking Conference (IFIP Networking) and Workshops
- 2018

The first approximation algorithm for the VNEP in the resource augmentation model is obtained, based on the randomized rounding of Linear Programming (LP) solutions, and it is shown that these consistently yield good solutions (even without augmentations). Expand

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

- Computer Science
- IEEE/ACM Transactions on Networking
- 2012

A collection of VN embedding algorithms that leverage better coordination between the node mapping and link mapping phases and show that the proposed algorithms increase the acceptance ratio and the revenue while decreasing the cost incurred by the substrate network in the long run. Expand

On the Hardness and Inapproximability of Virtual Network Embeddings

- Computer Science
- IEEE/ACM Transactions on Networking
- 2020

A first comprehensive study of the computational complexity of the VNEP by systematically analyzing its hardness for any combination of the above stated mapping restrictions. Expand

It's About Time: On Optimal Virtual Network Embeddings under Temporal Flexibilities

- Computer Science
- 2014 IEEE 28th International Parallel and Distributed Processing Symposium
- 2014

This paper proposes a continuous-time mathematical programming approach to solve the temporal VNet embedding problem (TVNEP), and presents the CSM-Model which incorporates both symmetry and state-space reductions to significantly speed up the process of computing exact solutions to the TVNEP. Expand

Cost-Efficient Embedding of Virtual Networks With and Without Routing Flexibility

- Computer Science
- 2020 IFIP Networking Conference (Networking)
- 2020

This paper analytically proves that the proposed algorithm achieves an XP approximation: a constant approximation in a resource augmentation model for scenarios with and without routing flexibilities, and indicates that the algorithm is not only of theoretical interest but is a practical solution. Expand

Beyond the Stars: Revisiting Virtual Cluster Embeddings

- Computer Science
- CCRV
- 2015

It is shown that the virtual cluster embedding problem is not NP-hard, and the fast and optimal embedding algorithm VC-ACE for arbitrary datacenter topologies is presented, and it is argued that resources may be wasted by enforcing star-topology embeddings and alternatively promote a hose embedding approach. Expand

Competitive and deterministic embeddings of virtual networks

- Computer Science
- Theor. Comput. Sci.
- 2013

This article describes a generic algorithm for the online VNet embedding problem whose performance is competitive to an optimal offline algorithm that has complete knowledge of the request sequence in advance: the so-called competitive ratio is logarithmic in the sum of the resources. Expand

Reducing dense virtual networks for fast embedding

- Computer Science
- IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications
- 2016

This paper analytically and empirically investigates the trade-off between the embedding time and cost for the virtual network reduction and defines two simple reduction algorithms and analyze them with several interesting theorems. Expand

Topology-Oriented Virtual Network Embedding Approach for Data Centers

- Computer Science
- IEEE Access
- 2019

This paper develops a topology-oriented algorithm based on the Discrete Particle Swarm Optimization (DPSO) to solve the VNE problem in data centers and shows that the proposed algorithm can improve the optimization performance of VNE by comparing with a few existing algorithms. Expand