128 citations · 139 across the 20 of their papers we have counts for
8 papers · 1 filter
Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks
Neta Rozen Schiff, Klaus-Tycho Foerster, Stefan Schmid +1
The performance of distributed and data-centric applications often critically depends on the interconnecting network. Emerging reconfigurable datacenter networks (RDCNs) are a part…
The Augmentation-Speed Tradeoff for Consistent Network Updates
Monika Henzinger, Ami Paz, Arash Pourdamghani +1
Emerging software-defined networking technologies enable more adaptive communication infrastructures, allowing for quick reactions to changes in networking requirements by exploiti…
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
We study the broadcast problem on dynamic networks with processes. The processes communicate in synchronous rounds along an arbitrary rooted tree. The sequence of trees is give…
Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
Data dissemination is a fundamental task in distributed computing. This paper studies broadcast problems in various innovative models where the communication network connecting …
Online Admission Control and Rebalancing in Payment Channel Networks
Mahsa Bastankhah, Krishnendu Chatterjee, Mohammad Ali Maddah-Ali +3
Payment channel networks (PCNs) are a promising technology to improve the scalability of cryptocurrencies. PCNs, however, face the challenge that the frequent usage of certain rout…
Optimizing Reconfigurable Optical Datacenters: The Power of Randomization
Marcin Bienkowski, David Fuchssteiner, Stefan Schmid
Reconfigurable optical topologies are a promising new technology to improve datacenter network performance and cope with the explosive growth of traffic. In particular, these netwo…
Model-Based Insights on the Performance, Fairness, and Stability of BBR
Simon Scherrer, Markus Legner, Adrian Perrig +1
Google's BBR is the most prominent result of the recently revived quest for efficient, fair, and flexible congestion-control algorithms (CCAs). While the performance of BBR has bee…
Self-Adjusting Linear Networks with Ladder Demand Graph
Anton Paramonov, Iosif Salem, Stefan Schmid +1
Self-adjusting networks (SANs) have the ability to adapt to communication demand by dynamically adjusting the workload (or demand) embedding, i.e., the mapping of communication req…