7 papers
Optimal Virtual Network Embeddings for Tree Topologies
Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier +3
The performance of distributed and data-centric applications often critically depends on the interconnecting network. Applications are hence modeled as virtual networks, also accou…
It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints
Robin Münk, Matthias Rost, Stefan Schmid +1
This paper proposes a new approximation algorithm for the offline Virtual Network Embedding Problem (VNEP) with latency constraints. Given is a set of virtual networks with computa…
(FPT-)Approximation Algorithms for the Virtual Network Embedding Problem
Matthias Rost, Stefan Schmid
Many resource allocation problems in the cloud can be described as a basic Virtual Network Embedding Problem (VNEP): finding mappings of request graphs (describing the workloads) o…
Virtual Network Embedding Approximations: Leveraging Randomized Rounding
Matthias Rost, Stefan Schmid
The Virtual Network Embedding Problem (VNEP) captures the essence of many resource allocation problems of today's infrastructure providers, which offer their physical computation a…
Approximate and Incremental Network Function Placement
Tamas Lukovszki, Matthias Rost, Stefan Schmid
The virtualization and softwarization of modern computer networks introduces interesting new opportunities for a more flexible placement of network functions and middleboxes (firew…
Service Chain and Virtual Network Embeddings: Approximations using Randomized Rounding
Matthias Rost, Stefan Schmid
The SDN and NFV paradigms enable novel network services which can be realized and embedded in a flexible and rapid manner. For example, SDN can be used to flexibly steer traffic fr…