112 citations · 667 across the 96 of their papers we have counts for
9 papers · 1 filter
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…
On the Power of Preprocessing in Decentralized Network Optimization
Klaus-Tycho Foerster, Juho Hirvonen, Stefan Schmid +1
As communication networks are growing at a fast pace, the need for more scalable approaches to operate such networks is pressing. Decentralization and locality are key concepts to…
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…
Push-Down Trees: Optimal Self-Adjusting Complete Trees
Chen Avin, Kaushik Mondal, Stefan Schmid
This paper studies a fundamental algorithmic problem related to the design of demand-aware networks: networks whose topologies adjust toward the traffic patterns they serve, in an…
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…
Short Schedules for Fast Flow Rerouting
Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham +2
This paper studies the fundamental problem of how to reroute unsplittable flows of a certain demand in a capacitated network from their current paths to their respective new pa…