15 citations · 47 across the 17 of their papers we have counts for
19 papers
An improved Lower Bound for Local Failover in Directed Networks via Binary Covering Arrays
Erik van den Akker, Klaus-Tycho Foerster
Communication networks often rely on some form of local failover rules for fast forwarding decisions upon link failures. While on undirected networks, up to two failures can be tol…
On the Resilience of Fast Failover Routing Against Dynamic Link Failures
Wenkai Dai, Klaus-Tycho Foerster, Stefan Schmid
Modern communication networks feature local fast failover mechanisms in the data plane, to swiftly respond to link failures with pre-installed rerouting rules. This paper explores…
Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
Erik van den Akker, Kevin Buchin, Klaus-Tycho Foerster
We study the problem of multi-agent online graph exploration, in which a team of k agents has to explore a given graph, starting and ending on the same node. The graph is initially…
Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks
Wenkai Dai, Michael Dinitz, Klaus-Tycho Foerster +2
Emerging reconfigurable optical communication technologies allow to enhance datacenter topologies with demand-aware links optimized towards traffic patterns. This paper studies the…
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…
On the Price of Locality in Static Fast Rerouting
Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet +2
Modern communication networks feature fully decentralized flow rerouting mechanisms which allow them to quickly react to link failures. This paper revisits the fundamental algorith…
A Centrality Analysis of the Lightning Network
Philipp Zabka, Klaus-Tycho Foerster, Stefan Schmid +1
Payment channel networks (PCNs) such as the Lightning Network offer an appealing solution to the scalability problem faced by many cryptocurrencies operating on a blockchain such a…
Shortcutting Fast Failover Routes in the Data Plane
Apoorv Shukla, Klaus-Tycho Foerster
In networks, availability is of paramount importance. As link failures are disruptive, modern networks in turn provide Fast ReRoute (FRR) mechanisms to rapidly restore connectivity…
Improving the Resilience of Fast Failover Routing: TREE (Tree Routing to Extend Edge disjoint paths)
Oliver Schweiger, Klaus-Tycho Foerster, Stefan Schmid
Today's communication networks have stringent availability requirements and hence need to rapidly restore connectivity after failures. Modern networks thus implement various forms…
On Comparing and Enhancing Common Approaches to Network Community Detection
Niko Motschnig, Alexander Ramharter, Oliver Schweiger +2
In this work, we explore four common algorithms for community detection in networks, namely Agglomerative Hierarchical Clustering, Divisive Hierarchical Clustering (Girvan-Newman),…
On the Feasibility of Perfect Resilience with Local Fast Failover
Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet +2
In order to provide a high resilience and to react quickly to link failures, modern computer networks support fully decentralized flow rerouting, also known as local fast failover.…
Input-Dynamic Distributed Algorithms for Communication Networks
Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz +2
Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explor…
Conic Formation in Presence of Faulty Robots
Debasish Pattanayak, Klaus-Tycho Foerster, Partha Sarathi Mandal +1
Pattern formation is one of the most fundamental problems in distributed computing, which has recently received much attention. In this paper, we initiate the study of distributed…
Toward Active and Passive Confidentiality Attacks On Cryptocurrency Off-Chain Networks
Utz Nisslmueller, Klaus-Tycho Foerster, Stefan Schmid +1
Cryptocurrency off-chain networks such as Lightning (e.g., Bitcoin) or Raiden (e.g., Ethereum) aim to increase the scalability of traditional on-chain transactions. To support node…
Distributed Consistent Network Updates in SDNs: Local Verification for Global Guarantees
Klaus-Tycho Foerster, Stefan Schmid
While SDNs enable more flexible and adaptive network operations, (logically) centralized reconfigurations introduce overheads and delays, which can limit network reactivity. This p…
Brief Announcement: Does Preprocessing Help under Congestion?
Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki +1
This paper investigates the power of preprocessing in the CONGEST model. Schmid and Suomela (ACM HotSDN 2013) introduced the SUPPORTED CONGEST model to study the application of dis…
Online Graph Exploration on a Restricted Graph Class: Optimal Solutions for Tadpole Graphs
Sebastian Brandt, Klaus-Tycho Foerster, Jonathan Maurer +1
We study the problem of online graph exploration on undirected graphs, where a searcher has to visit every vertex and return to the origin. Once a new vertex is visited, the search…
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…
Charting the Complexity Landscape of Waypoint Routing
Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob +1
Modern computer networks support interesting new routing models in which traffic flows from a source s to a destination t can be flexibly steered through a sequence of waypoints, s…