12 citations · 25 across the 12 of their papers we have counts for
10 papers · 1 filter
Near-Shortest Path Routing in Hybrid Communication Networks
Sam Coy, Artur Czumaj, Michael Feldmann +5
Hybrid networks, i.e., networks that leverage different means of communication, become ever more widespread. To allow theoretical study of such networks, [Augustine et al., SODA'20…
Accelerating Amoebots via Reconfigurable Circuits
Michael Feldmann, Andreas Padalkin, Christian Scheideler +1
We consider an extension to the geometric amoebot model that allows amoebots to form so-called \emph{circuits}. Given a connected amoebot structure, a circuit is a subgraph formed…
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
Michael Feldmann, Kristian Hinnenthal, Christian Scheideler
We consider the problem of computing shortest paths in hybrid networks, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc conn…
Time- and Space-Optimal Clock Synchronization in the Beeping Model
Michael Feldmann, Ardalan Khazraei, Christian Scheideler
We consider the clock synchronization problem in the (discrete) beeping model: Given a network of nodes with each node having a clock value , the goa…
A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory
Michael Feldmann, Thorsten Götte, Christian Scheideler
We consider congestion control in peer-to-peer distributed systems. The problem can be reduced to the following scenario: Consider a set of peers (called clients in this pa…
Self-stabilizing Overlays for high-dimensional Monotonic Searchability
Michael Feldmann, Christina Kolb, Christian Scheideler
We extend the concept of monotonic searchability for self-stabilizing systems from one to multiple dimensions. A system is self-stabilizing if it can recover to a legitimate state…
Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities
Michael Feldmann, Christian Scheideler
We propose two protocols for distributed priority queues (for simplicity denoted 'heap') called SKEAP and SEAP. SKEAP realizes a distributed heap for a constant amount of prioritie…
Skueue: A Scalable and Sequentially Consistent Distributed Queue
Michael Feldmann, Christian Scheideler, Alexander Setzer
We propose a distributed protocol for a queue, called \textsc{Skueue}, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios. \te…
Self-Stabilizing Supervised Publish-Subscribe Systems
Michael Feldmann, Christina Kolb, Christian Scheideler +1
In this paper we present two major results: First, we introduce the first self-stabilizing version of a supervised overlay network by presenting a self-stabilizing supervised skip…
A Self-Stabilizing General De Bruijn Graph
Michael Feldmann, Christian Scheideler
Searching for other participants is one of the most important operations in a distributed system. We are interested in topologies in which it is possible to route a packet in a fix…