| Network service chaining with optimized network function embedding supporting service decompositions S Sahhaf, W Tavernier, M Rost, S Schmid, D Colle, M Pickavet, ... Computer Networks 93, 492-505, 2015 | 171 | 2015 |
| Good network updates for bad packets: Waypoint enforcement beyond destination-based routing policies A Ludwig, M Rost, D Foucard, S Schmid Proceedings of the 13th ACM Workshop on Hot Topics in Networks, 1-7, 2014 | 97 | 2014 |
| Transiently secure network updates A Ludwig, S Dudycz, M Rost, S Schmid ACM SIGMETRICS Performance Evaluation Review 44 (1), 273-284, 2016 | 67 | 2016 |
| It's a match! near-optimal and incremental middlebox deployment T Lukovszki, M Rost, S Schmid ACM SIGCOMM Computer Communication Review 46 (1), 30-36, 2016 | 64 | 2016 |
| Virtual network embedding approximations: Leveraging randomized rounding M Rost, S Schmid IEEE/ACM Transactions on Networking 27 (5), 2071-2084, 2019 | 59 | 2019 |
| Stitching inter-domain paths over IXPs V Kotronis, R Klöti, M Rost, P Georgopoulos, B Ager, S Schmid, ... Proceedings of the Symposium on SDN Research, 1-12, 2016 | 56 | 2016 |
| Beyond the stars: Revisiting virtual cluster embeddings M Rost, C Fuerst, S Schmid ACM SIGCOMM Computer Communication Review 45 (3), 12-18, 2015 | 51 | 2015 |
| An approximation algorithm for path computation and function placement in SDNs G Even, M Rost, S Schmid Structural Information and Communication Complexity: 23rd International …, 2016 | 50 | 2016 |
| Charting the complexity landscape of virtual network embeddings M Rost, S Schmid 2018 IFIP Networking Conference (IFIP Networking) and Workshops, 1-9, 2018 | 47 | 2018 |
| Service chain and virtual network embeddings: Approximations using randomized rounding M Rost, S Schmid arXiv preprint arXiv:1604.02180, 2016 | 45 | 2016 |
| Towards unified programmability of cloud and carrier infrastructure P Sköldström, B Sonkoly, A Gulyás, F Németh, M Kind, FJ Westphal, ... 2014 Third European Workshop on Software Defined Networks, 55-60, 2014 | 39 | 2014 |
| Approximate and incremental network function placement T Lukovszki, M Rost, S Schmid Journal of Parallel and Distributed Computing 120, 159-169, 2018 | 30 | 2018 |
| On the Hardness and Inapproximability of Virtual Network Embeddings M Rost, S Schmid IEEE/ACM Transactions on Networking, 2020 | 25 | 2020 |
| It's about time: On optimal virtual network embeddings under temporal flexibilities M Rost, S Schmid, A Feldmann 2014 IEEE 28th International Parallel and Distributed Processing Symposium …, 2014 | 25 | 2014 |
| NP-Completeness and Inapproximability of the Virtual Network Embedding Problem and Its Variants M Rost, S Schmid arXiv preprint arXiv:1801.03162, 2018 | 22 | 2018 |
| Efficient Service Graph Embedding: A Practical Approach B Németh, B Sonkoly, M Rost, S Schmid International Workshop on Orchestration for Software Defined Infrastructures …, 2016 | 22 | 2016 |
| Parametrized complexity of virtual network embeddings: Dynamic & linear programming approximations M Rost, E Döhne, S Schmid ACM SIGCOMM Computer Communication Review 49 (1), 3-10, 2019 | 21 | 2019 |
| Fast and efficient network service embedding method with adaptive offloading to the edge B Németh, M Szalay, J Dóka, M Rost, S Schmid, L Toka, B Sonkoly IEEE INFOCOM 2018-IEEE Conference on Computer Communications Workshops …, 2018 | 12 | 2018 |
| Investigating the potential of the Inter-IXP multigraph for the provisioning of guaranteed end-to-end services V Kotronis, R Klöti, M Rost, P Georgopoulos, B Ager, S Schmid, ... ACM SIGMETRICS Performance Evaluation Review 43 (1), 429-430, 2015 | 8 | 2015 |
| A constant approximation for maximum throughput multicommodity routing and its application to delay-tolerant network scheduling M Liu, AW Richa, M Rost, S Schmid IEEE INFOCOM 2019-IEEE Conference on Computer Communications, 46-54, 2019 | 5 | 2019 |
Stefan SchmidProfessor, Computer Science, TU Berlin & University of ViennaBestätigte E-Mail-Adresse bei tu-berlin.de
