112 citations · 667 across the 96 of their papers we have counts for
56 papers · 1 filter
P4RROT: Generating P4 Code for the Application Layer
Csaba Györgyi, Sándor Laki, Stefan Schmid
Throughput and latency critical applications could often benefit of performing computations close to the client. To enable this, distributed computing paradigms such as edge comput…
Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks
Vamsi Addanki, Chen Avin, Stefan Schmid
The performance of large-scale computing systems often critically depends on high-performance communication networks. Dynamically reconfigurable topologies, e.g., based on optical…
Kevin: de Bruijn-based topology with demand-aware links and greedy routing
Johannes Zerwas, Csaba Györgyi, Andreas Blenk +2
We propose Kevin, a novel demand-aware reconfigurable rack-to-rack datacenter network realized with a simple and efficient control plane. In particular, Kevin makes effective use o…
Improving the Resilience of Fast Failover Routing: TREE (Tree Routing to Extend Edge disjoint paths)
Oliver Schweiger, Klaus-Tycho Foerster, Stefan Schmid
Today's communication networks have stringent availability requirements and hence need to rapidly restore connectivity after failures. Modern networks thus implement various forms…
The Programmable Data Plane: Abstractions, Architectures, Algorithms, and Applications
Oliver Michel, Roberto Bifulco, Gabor Retvari +1
Programmable data plane technology enables the systematic reconfiguration of the low-level processing steps applied to network packets and is a key driver in realizing the next gen…
An Axiomatic Perspective on the Performance Effects of End-Host Path Selection
Simon Scherrer, Markus Legner, Adrian Perrig +1
In various contexts of networking research, end-host path selection has recently regained momentum as a design principle. While such path selection has the potential to increase pe…