Matthias Rost

Orcid: 0000-0002-2380-0284

Affiliations:
  • Technical University of Berlin, Germany (PhD 2019)


According to our database1, Matthias Rost authored at least 33 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Improved Throughput for All-or-Nothing Multicommodity Flows With Arbitrary Demands.
IEEE/ACM Trans. Netw., April, 2024

2022
Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands.
SIGMETRICS Perform. Evaluation Rev., 2022

2021
Optimal Virtual Network Embeddings for Tree Topologies.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints.
Proceedings of the IFIP Networking Conference, 2021

2020
On the Hardness and Inapproximability of Virtual Network Embeddings.
IEEE/ACM Trans. Netw., 2020

Improved Bi-criteria Approximation for the All-or-Nothing Multicommodity Flow Problem in Arbitrary Networks.
CoRR, 2020

Cost-Efficient Embedding of Virtual Networks With and Without Routing Flexibility.
Proceedings of the 2020 IFIP Networking Conference, 2020

Edge replication strategies for wide-area distributed processing.
Proceedings of the 3rd International Workshop on Edge Systems, Analytics and Networking, 2020

2019
Virtual network embeddings: Theoretical foundations and provably good algorithms.
PhD thesis, 2019

Virtual Network Embedding Approximations: Leveraging Randomized Rounding.
IEEE/ACM Trans. Netw., 2019

Parametrized complexity of virtual network embeddings: dynamic & linear programming approximations.
Comput. Commun. Rev., 2019

Modeling Adaptive Video Streaming Using Discrete-Time Analysis.
Proceedings of the 31st International Teletraffic Congress, 2019

A Constant Approximation for Maximum Throughput Multicommodity Routing And Its Application to Delay-Tolerant Network Scheduling.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

2018
Transiently Policy-Compliant Network Updates.
IEEE/ACM Trans. Netw., 2018

Approximate and incremental network function placement.
J. Parallel Distributed Comput., 2018

(FPT-)Approximation Algorithms for the Virtual Network Embedding Problem.
CoRR, 2018

NP-Completeness and Inapproximability of the Virtual Network Embedding Problem and Its Variants.
CoRR, 2018

Charting the Complexity Landscape of Virtual Network Embeddings.
Proceedings of the 2018 IFIP Networking Conference and Workshops, 2018

Fast and efficient network service embedding method with adaptive offloading to the edge.
Proceedings of the IEEE INFOCOM 2018, 2018

2016
Service Chain and Virtual Network Embeddings: Approximations using Randomized Rounding.
CoRR, 2016

It's a Match!: Near-Optimal and Incremental Middlebox Deployment.
Comput. Commun. Rev., 2016

Stitching Inter-Domain Paths over IXPs.
Proceedings of the Symposium on SDN Research, 2016

An Approximation Algorithm for Path Computation and Function Placement in SDNs.
Proceedings of the Structural Information and Communication Complexity, 2016

Transiently Secure Network Updates.
Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, 2016

Efficient service graph embedding: A practical approach.
Proceedings of the 2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN), 2016

2015
Network service chaining with optimized network function embedding supporting service decompositions.
Comput. Networks, 2015

Beyond the Stars: Revisiting Virtual Cluster Embeddings.
Comput. Commun. Rev., 2015

Investigating the Potential of the Inter-IXP Multigraph for the Provisioning of Guaranteed End-to-End Services.
Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2015

2014
It's About Time: On Optimal Virtual Network Embeddings under Temporal Flexibilities.
Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

Good Network Updates for Bad Packets: Waypoint Enforcement Beyond Destination-Based Routing Policies.
Proceedings of the 13th ACM Workshop on Hot Topics in Networks, 2014

Towards Unified Programmability of Cloud and Carrier Infrastructure.
Proceedings of the Third European Workshop on Software Defined Networks, 2014

2013
The Constrained Virtual Steiner Arborescence Problem: Formal Definition, Single-Commodity Integer Programming Formulation and Computational Evaluation.
CoRR, 2013

VirtuCast: Multicast and Aggregation with In-Network Processing - An Exact Single-Commodity Algorithm.
Proceedings of the Principles of Distributed Systems - 17th International Conference, 2013


  Loading...