Name
Abstract | ||
|---|---|---|
To provide fast traffic recovery upon failures, most modern networks support static Fast Rerouting (FRR) mechanisms for mission critical services. However, configuring FRR mechanisms to tolerate multiple failures poses challenging algorithmic problems. While state-of-the-art solutions leveraging arc-disjoint arborescence-based network decompositions ensure that failover routes always reach their destinations eventually, even under multiple concurrent failures, these routes may be long and introduce unnecessary loads; moreover, they are tailored to worst-case failure scenarios. This paper presents an algorithmic framework for improving a given FRR network decomposition, using postprocessing. In particular, our framework is based on iterative arc swapping strategies and supports a number of use cases, from strengthening the resilience (e.g., in the presence of shared risk link groups) to improving the quality of the resulting routes (e.g., reducing route lengths and induced loads). Our simulations show that postprocessing is indeed beneficial in various scenarios, and can therefore enhance today's approaches. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/SRDS47363.2019.00028 | 2019 38th Symposium on Reliable Distributed Systems (SRDS) |
Keywords | DocType | ISSN |
Fast rerouting,FRR,fault tolerance,postprocessing,arborescence | Conference | 1060-9857 |
ISBN | Citations | PageRank |
978-1-7281-4223-4 | 1 | 0.35 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Klaus-Tycho Förster | 1 | 142 | 18.31 |
| Andrzej Kamisinski | 2 | 34 | 6.21 |
| Yvonne Anne Pignolet | 3 | 118 | 21.26 |
| Stefan Schmid | 4 | 559 | 71.98 |
| gilles tredan | 5 | 13 | 5.27 |