Emerging applications expect fast turn-around from in-network failover mechanisms. This
paper starts exploring the design space for supporting high availability and low latency …

To provide a high availability and to be able to quickly react to link failures, most
communication networks feature fast rerouting (FRR) mechanisms in the data plane …

Modern communication networks feature fully decen-tralized flow rerouting mechanisms
which allow them to quickly react to link failures. This paper revisits the fundamental …

We investigate multiple random walks traversing independently and concurrently on
complex networks and introduce the concept of mean first parallel passage time (MFPPT) to …

Today's communication networks have stringent availability requirements and hence need
to rapidly restore connectivity after failures. Modern networks thus implement various forms …

We study the cover time of multiple walks in a graph following the rotor-router mechanism.
This mechanism can be seen as a derandomization of multiple random walks, in which …

Emerging network applications (augmented reality, industrial Internet, etc.) introduce
stringent new requirements on the performance, dependability, and adaptability of …

Consider k identical robots traversing the edges of a geometric tree. The robots have to
patrol the tree by perpetually moving along edges, but without exceeding their maximum unit …

The paper formalizes a version of parallel online directed acyclic graph (DAG) exploration,
general enough to be readily mapped to many computational scenarios. In both the offline …

The rotor-router model, also called the Propp machine, was introduced as a deterministic
alternative to the random walk. In this model, a group of identical tokens are initially placed …