128 citations · 139 across the 20 of their papers we have counts for
15 papers · 1 filter
Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding
Aleksander Figiel, Janne H. Korhonen, Neil Olver +1
Emerging optical and virtualization technologies enable the design of more flexible and demand-aware networked systems, in which resources can be optimized toward the actual worklo…
RIFO: Pushing the Efficiency of Programmable Packet Schedulers
Habib Mostafaei, Maciej Pacut, Stefan Schmid
Packet scheduling is a fundamental networking task that recently received renewed attention in the context of programmable data planes. Programmable packet scheduling systems such…
Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults
Christoph Lenzen, Moti Medina, Mehrdad Saberi +1
With the increasing scale of communication networks, the likelihood of failures grows as well. Since these networks form a critical backbone of our digital society, it is important…
MCQUIC - A Multicast Extension for QUIC
Max Franke, Jake Holland, Stefan Schmid
Mass live content, such as world cups, the Superbowl or the Olympics, attract audiences of hundreds of millions of viewers. While such events were predominantly consumed on TV, mor…
Dynamic Probabilistic Reliable Broadcast
Veronika Anikina, João Paulo Bezerra, Petr Kuznetsov +2
Byzantine reliable broadcast is a fundamental primitive in distributed systems that allows a set of processes to agree on a message broadcast by a dedicated process, even when some…
An Improved Subquadratic Bound for Online Bisection
Marcin Bienkowski, Stefan Schmid
The online bisection problem is a natural dynamic variant of the classic bisection problem, where one has to dynamically maintain a partition of elements into two clusters of c…
Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands
Harald Räcke, Stefan Schmid, Ruslan Zabrodin
The performance of many large-scale and data-intensive distributed systems critically depends on the capacity of the interconnecting network. This paper is motivated by the vision…
Topological Characterization of Consensus Solvability in Directed Dynamic Networks
Hugo Rincon Galeana, Ulrich Schmid, Kyrill Winkler +2
Consensus is one of the most fundamental problems in distributed computing. This paper studies the consensus problem in a synchronous dynamic directed network, in which communicati…
Performance Analysis of Machine Learning Centered Workload Prediction Models for Cloud
Deepika Saxena, Jitendra Kumar, Ashutosh Kumar Singh +1
The precise estimation of resource usage is a complex and challenging issue due to the high variability and dimensionality of heterogeneous service types and dynamic workloads. Ove…
Toward Self-Adjusting k-ary Search Tree Networks
Evgenii Feder, Anton Paramonov, Pavel Mavrin +3
Datacenter networks are becoming increasingly flexible with the incorporation of new networking technologies, such as optical circuit switches. These technologies allow for program…
Time Complexity of Broadcast and Consensus for Randomized Oblivious Message Adversaries
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
Broadcast and consensus are most fundamental tasks in distributed computing. These tasks are particularly challenging in dynamic networks where communication across the network lin…
Online Algorithms with Randomly Infused Advice
Yuval Emek, Yuval Gil, Maciej Pacut +1
We introduce a novel method for the rigorous quantitative evaluation of online algorithms that relaxes the "radical worst-case" perspective of classic competitive analysis. In cont…
SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree
Arash Pourdamghani, Chen Avin, Robert Sama +1
We consider the fundamental problem of designing a self-adjusting tree, which efficiently and locally adapts itself towards the demand it serves (namely accesses to the items store…
Dynamic Maintenance of Monotone Dynamic Programs and Applications
Monika Henzinger, Stefan Neumann, Harald Räcke +1
Dynamic programming (DP) is one of the fundamental paradigms in algorithm design. However, many DP algorithms have to fill in large DP tables, represented by two-dimensional arrays…
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters
Kathrin Hanauer, Monika Henzinger, Lara Ost +1
Emerging reconfigurable datacenters allow to dynamically adjust the network topology in a demand-aware manner. These datacenters rely on optical switches which can be reconfigured…