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

Figures from this paper

References

SHOWING 1-6 OF 6 REFERENCES
On the computational complexity of the virtual network embedding problem
ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping
Minimum congestion mapping in a cloud
Towards predictable datacenter networks
A scalable, commodity data center network architecture
Virtual Network Embedding: A Survey