1 citations · 2 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026★ 1 cited
Perfect Network Resilience in Polynomial Time
Matthias Bentert, Stefan Schmid
Modern communication networks support local fast rerouting mechanisms to quickly react to link failures: nodes store a set of conditional rerouting rules which define how to forwar…
cs.DS2026
Complexity of Perfect and Ideal Resilience Verification in Fast Re-Route Networks
Matthias Bentert, Esra Ceylan-Kettler, Valentin Hübner +2
To achieve fast recovery from link failures, most modern communication networks feature fully decentralized fast re-routing mechanisms. These re-routing mechanisms rely on pre-inst…