35 citations · 68 across the 8 of their papers we have counts for
12 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…
Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands
Anya Chaturvedi, Chandra Chekuri, Mengxue Liu +4
Throughput is a main performance objective in communication networks. This paper considers a fundamental maximum throughput routing problem -- the all-or-nothing multicommodity flo…
(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…
NP-Completeness and Inapproximability of the Virtual Network Embedding Problem and Its Variants
Matthias Rost, Stefan Schmid
Many resource allocation problems in the cloud can be described as a basic Virtual Network Embedding Problem (VNEP): the problem of finding a mapping of a request graph (describing…
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…
Investigating the Potential of the Inter-IXP Multigraph for the Provisioning of Guaranteed End-to-End Services
Vasileios Kotronis, Rowan Kloti, Matthias Rost +4
In this work, we propose utilizing the rich connectivity between IXPs and ISPs for inter-domain path stitching, supervised by centralized QoS brokers. In this context, we highlight…
Stitching Inter-Domain Paths over IXPs
Vasileios Kotronis, Rowan Kloti, Matthias Rost +4
Modern Internet applications, from HD video-conferencing to health monitoring and remote control of power-plants, pose stringent demands on network latency, bandwidth and availabil…
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…
An Approximation Algorithm for Path Computation and Function Placement in SDNs
Guy Even, Matthias Rost, Stefan Schmid
We consider the task of computing (combined) function mapping and routing for requests in Software-Defined Networks (SDNs). Function mapping refers to the assignment of nodes in th…
The Constrained Virtual Steiner Arborescence Problem: Formal Definition, Single-Commodity Integer Programming Formulation and Computational Evaluation
Matthias Rost, Stefan Schmid
As the Internet becomes more virtualized and software-defined, new functionality is introduced in the network core: the distributed resources available in ISP central offices, univ…