IP fast rerouting for multi-link failures
Citations
68 citations
53 citations
43 citations
Cites background or methods or result from "IP fast rerouting for multi-link fa..."
...More recent results show that for any k-connected network, k bits are sufficient to compute forwarding tables that are robust to (k − 1) link failures [2]....
[...]
..., resiliency to multiple simultaneous link failures is crucial in overlay networks over optical backbone networks [2], [3]), (2) the structural properties of the network graph (e....
[...]
...We define the stretch of a routing function R as the ratio between the number of links traversed by algorithm and the number of links traversed by the algorithm in [2]....
[...]
...Past work [14], [15] (1) achieved guaranteed robustness against only a single link/node failure [16]–[21], (2) achieved robustness against ⌊k2−1⌋ link failures for k-connected networks [2], and (3) proved that resiliency to any set of link failures [17] cannot be achieved....
[...]
...As in [2], we leverage a well-known result from graph theory [23], which allows us to decompose any k-connected graph in a set of k directed spanning trees (rooted at the same vertex) such that no pair of spanning trees shares an edge in the same direction....
[...]
30 citations
Additional excerpts
...The possibility ofmultiple link failures [2, 10, 21], e....
[...]
25 citations
References
854 citations
183 citations
164 citations
141 citations
[...]
136 citations