activity
20102024
most citedThe Programmable Data Plane: Abstractions, Architectures, Algorithms, and Applications

112 citations · 667 across the 96 of their papers we have counts for

collaborators
Showing 2017 · cs.NIShow all

5 papers · 2 filters

cs.NI2017

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…

cs.NI2017★ 3 cited

Towards Communication-Aware Robust Topologies

Chen Avin, Alexandr Hercules, Andreas Loukas +1

We currently witness the emergence of interesting new network topologies optimized towards the traffic matrices they serve, such as demand-aware datacenter interconnects (e.g., Pro…

cs.NI2017★ 3 cited

Charting the Complexity Landscape of Waypoint Routing

Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob +1

Modern computer networks support interesting new routing models in which traffic flows from a source s to a destination t can be flexibly steered through a sequence of waypoints, s…

cs.NI2017★ 2 cited

Software-Defined Adversarial Trajectory Sampling

Kashyap Thimmaraju, Liron Schiff, Stefan Schmid

Today's routing protocols critically rely on the assumption that the underlying hardware is trusted. Given the increasing number of attacks on network devices, and recent reports o…

cs.NI2017

Logically Isolated, Actually Unpredictable? Measuring Hypervisor Performance in Multi-Tenant SDNs

Arsany Basta, Andreas Blenk, Wolfgang Kellerer +1

Ideally, by enabling multi-tenancy, network virtualization allows to improve resource utilization, while providing performance isolation: although the underlying resources are shar…