activity
20172026
most citedOn Comparing and Enhancing Common Approaches to Network Community Detection

5 citations · 10 across the 9 of their papers we have counts for

collaborators
Showing cs.NIShow all

5 papers · 1 filter

cs.NI2024

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…

cs.NI2021

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…

cs.NI2021

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…

cs.NI2020

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.…

cs.NI2017

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…