15 citations · 47 across the 17 of their papers we have counts for
3 papers · 1 filter
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),…