112 citations · 667 across the 96 of their papers we have counts for
6 papers · 2 filters
Compact Oblivious Routing
Harald Räcke, Stefan Schmid
Oblivious routing is an attractive paradigm for large distributed systems in which centralized control and frequent reconfigurations are infeasible or undesired (e.g., costly). Ove…
Toward Demand-Aware Networking: A Theory for Self-Adjusting Networks
Chen Avin, Stefan Schmid
The physical topology is emerging as the next frontier in an ongoing effort to render communication networks more flexible. While first empirical results indicate that these flexib…
Charting the Security Landscape of Programmable Dataplanes
Andrei-Alexandru Agape, Madalin Claudiu Danceanu, Rene Rydhof Hansen +1
Emerging programmable dataplanes will revamp communication networks, allowing programmers to reconfigure and tailor switches towards their need, in a protocol-independent manner. W…
(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…