b'Stefan Schmid'

research

∙ 08/21/2023

Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding

Emerging optical and virtualization technologies enable the design of mo...

0 Aleksander Figiel, et al. ∙

research

∙ 08/14/2023

RIFO: Pushing the Efficiency of Programmable Packet Schedulers

Packet scheduling is a fundamental networking task that recently receive...

0 Habib Mostafaei, et al. ∙

research

∙ 07/09/2023

Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults

With the increasing scale of communication networks, the likelihood of f...

0 Christoph Lenzen, et al. ∙

research

∙ 06/30/2023

MCQUIC – A Multicast Extension for QUIC

Mass live content, such as world cups, the Superbowl or the Olympics, at...

0 Max Franke, et al. ∙

research

∙ 06/07/2023

Dynamic Probabilistic Reliable Broadcast

Byzantine reliable broadcast is a primitive that allows a set of process...

0 Veronika Anikina, et al. ∙

research

∙ 05/02/2023

A Subquadratic Bound for Online Bisection

In the online bisection problem one has to maintain a partition of n ele...

0 Marcin Bienkowski, et al. ∙

research

∙ 04/20/2023

Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands

The performance of many large-scale and data-intensive distributed syste...

0 Harald Räcke, et al. ∙

research

∙ 04/05/2023

Topological Characterization of Consensus Solvability in Directed Dynamic Networks

Consensus is one of the most fundamental problems in distributed computi...

0 Hugo Rincon Galeana, et al. ∙

research

∙ 02/25/2023

Toward Self-Adjusting k-ary Search Tree Networks

Datacenter networks are becoming increasingly flexible with the incorpor...

0 Evgenii Feder, et al. ∙

research

∙ 02/23/2023

Time Complexity of Broadcast and Consensus for Randomized Oblivious Message Adversaries

Broadcast and consensus are most fundamental tasks in distributed comput...

0 Antoine El-Hayek, et al. ∙

research

∙ 02/10/2023

Online Algorithms with Randomly Infused Advice

We introduce a novel method for the rigorous quantitative evaluation of ...

0 Yuval Emek, et al. ∙

research

∙ 02/05/2023

Performance Analysis of Machine Learning Centered Workload Prediction Models for Cloud

The precise estimation of resource usage is a complex and challenging is...

0 Deepika Saxena, et al. ∙

research

∙ 01/13/2023

Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters

Emerging reconfigurable datacenters allow to dynamically adjust the netw...

0 Kathrin Hanauer, et al. ∙

research

∙ 01/08/2023

SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree

We consider the fundamental problem of designing a self-adjusting tree, ...

0 Arash Pourdamghani, et al. ∙

research

∙ 01/04/2023

Dynamic Maintenance of Monotone Dynamic Programs and Applications

Dynamic programming (DP) is one of the fundamental paradigms in algorith...

0 Monika Henzinger, et al. ∙

research

∙ 11/24/2022

Relation-based Motion Prediction using Traffic Scene Graphs

Representing relevant information of a traffic scene and understanding i...

0 Maximilian Zipfl, et al. ∙

research

∙ 11/21/2022

Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear

We study the broadcast problem on dynamic networks with n processes. The...

0 Antoine El-Hayek, et al. ∙

research

∙ 11/18/2022

Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks

Data dissemination is a fundamental task in distributed computing. This ...

0 Antoine El-Hayek, et al. ∙

research

∙ 11/11/2022

Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks

The performance of distributed and data-centric applications often criti...

0 Neta Rozen Schiff, et al. ∙

research

∙ 11/07/2022

The Augmentation-Speed Tradeoff for Consistent Network Updates

Emerging software-defined networking technologies enable more adaptive c...

0 Monika Henzinger, et al. ∙

research

∙ 09/24/2022

Online Admission Control and Rebalancing in Payment Channel Networks

Payment channel networks (PCNs) are a promising technology to improve th...

0 Mahsa Bastankhah, et al. ∙

research

∙ 09/05/2022

Online B-Matchings for Reconfigurable Datacenters: The Power of Randomization

This paper studies the problem of how to dynamically optimize the topolo...

0 Marcin Bienkowski, et al. ∙

research

∙ 08/22/2022

Model-Based Insights on the Performance, Fairness, and Stability of BBR

Google's BBR is the most prominent result of the recently revived quest ...

0 Simon Scherrer, et al. ∙

research

∙ 07/08/2022

Self-Adjusting Linear Networks with Ladder Demand Graph

This paper revisits the problem of designing online algorithms for self-...

0 Anton Paramonov, et al. ∙

research

∙ 05/23/2022

Wiser: Increasing Throughput in Payment Channel Networks with Transaction Aggregation

Payment channel networks (PCNs) are one of the most prominent solutions ...

0 Samarth Tiwari, et al. ∙

research

∙ 04/28/2022

Weighted Packet Selection for Rechargeable Links: Complexity and Approximation

We consider a natural problem dealing with weighted packet selection acr...

0 Stefan Schmid, et al. ∙

research

∙ 04/22/2022

Deterministic Self-Adjusting Tree Networks Using Rotor Walks

We revisit the design of self-adjusting single-source tree networks. The...

0 Chen Avin, et al. ∙

research

∙ 04/07/2022

On the Price of Locality in Static Fast Rerouting

Modern communication networks feature fully decentralized flow rerouting...

0 Klaus-Tycho Foerster, et al. ∙

research

∙ 04/06/2022

P4RROT: Generating P4 Code for the Application Layer

Throughput and latency critical applications could often benefit of perf...

0 Csaba Györgyi, et al. ∙

research

∙ 04/06/2022

Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks

The performance of large-scale computing systems often critically depend...

0 Vamsi Addanki, et al. ∙

research

∙ 02/24/2022

Time Complexity of Consensus in Dynamic Networks Under Oblivious Message Adversaries

Consensus is a most fundamental task in distributed computing. This pape...

0 Ami Paz, et al. ∙

research

∙ 02/11/2022

Kevin: de Bruijn-based topology with demand-aware links and greedy routing

We propose Kevin, a novel demand-aware reconfigurable rack-to-rack datac...

0 Johannes Zerwas, et al. ∙

research

∙ 01/19/2022

A Centrality Analysis of the Lightning Network

Payment channel networks (PCNs) such as the Lightning Network offer an a...

0 Philipp Zabka, et al. ∙

research

∙ 01/17/2022

Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies

Reconfigurable optical topologies promise to improve the performance in ...

0 Kathrin Hanauer, et al. ∙

research

∙ 12/28/2021

PowerTCP: Pushing the Performance Limits of Datacenter Networks

Increasingly stringent throughput and latency requirements in datacenter...

0 Vamsi Addanki, et al. ∙

research

∙ 11/28/2021

Improving the Resilience of Fast Failover Routing: TREE (Tree Routing to Extend Edge disjoint paths)

Today's communication networks have stringent availability requirements ...

0 Oliver Schweiger, et al. ∙

research

∙ 10/17/2021

HIDE SEEK: Privacy-Preserving Rebalancing on Payment Channel Networks

Payment channels effectively move the transaction load off-chain thereby...

0 Zeta Avarikioti, et al. ∙

research

∙ 10/01/2021

The Programmable Data Plane: Abstractions, Architectures, Algorithms, and Applications

Programmable data plane technology enables the systematic reconfiguratio...

0 Oliver Michel, et al. ∙

research

∙ 09/30/2021

Self-Adjusting Packet Classification

This paper is motivated by the vision of more efficient packet classific...

0 Maciej Pacut, et al. ∙

research

∙ 09/06/2021

An Axiomatic Perspective on the Performance Effects of End-Host Path Selection

In various contexts of networking research, end-host path selection has ...

0 Simon Scherrer, et al. ∙

research

∙ 08/05/2021

Sinkless orientation is hard also in the supported LOCAL model

We show that any algorithm that solves the sinkless orientation problem ...

0 Janne H. Korhonen, et al. ∙

research

∙ 08/04/2021

Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion

To ensure high availability, datacenter networks must rely on local fast...

0 Gregor Bankhamer, et al. ∙

research

∙ 05/27/2021

On the Complexity of Weight-Dynamic Network Algorithms

While operating communication networks adaptively may improve utilizatio...

0 Monika Henzinger, et al. ∙

research

∙ 05/14/2021

Optimal Virtual Network Embeddings for Tree Topologies

The performance of distributed and data-centric applications often criti...

0 Aleksander Figiel, et al. ∙

research

∙ 04/19/2021

It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints

This paper proposes a new approximation algorithm for the offline Virtua...

0 Robin Münk, et al. ∙

research

∙ 04/18/2021

Online List Access with Precedence Constraints

This paper considers a natural generalization of the online list access ...

0 Maciej Pacut, et al. ∙

research

∙ 04/09/2021

LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks

Payment channel networks are a promising approach to improve the scalabi...

0 Krzysztof Pietrzak, et al. ∙

research

∙ 04/06/2021

Enabling Novel Interconnection Agreements with Path-Aware Networking Architectures

Path-aware networks (PANs) are emerging as an intriguing new paradigm wi...

0 Simon Scherrer, et al. ∙

research

∙ 02/26/2021

Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory

Graphical games are a useful framework for modeling the interactions of ...

0 Juho Hirvonen, et al. ∙

research

∙ 02/18/2021

Locality in Online Algorithms

Online algorithms make decisions based on past inputs. In general, the d...

0 Maciej Pacut, et al. ∙

Stefan Schmid

Featured Co-authors