M. Al-fares, A. Loukissas, and A. Vahdat, A scalable, commodity data center network architecture, ACM SIGCOMM CCR, vol.38, issue.4, pp.63-74, 2008.

A. Bhalgat, R. Hariharan, T. Kavitha, and D. Panigrahi, Fast edge splitting and edmonds' arborescence construction for unweighted graphs, Proc. SODA, 2008.

M. Borokhovich, L. Schiff, and S. Schmid, Provable data plane connectivity with local fast failover: Introducing openflow graph algorithms, Proc. ACM SIGCOMM HotSDN, 2014.

M. Borokhovich and S. Schmid, How (not) to shoot in your foot with sdn local fast failover: A load-connectivity tradeoff, Proc. OPODIS, 2013.

M. Chiesa, A. Gurtov, A. Madry, S. Mitrovic, I. Nikolaevkiy et al., Exploring the limits of static failover routing (v4), 2016.

M. Chiesa, I. Nikolaevskiy, S. Mitrovic, A. V. Gurtov, A. Madry et al., On the resiliency of static forwarding tables, IEEE/ACM Trans. Netw, vol.25, issue.2, pp.1133-1146, 2017.

J. Edmonds, Edge-disjoint branchings, Combinatorial algorithms, vol.9, issue.2, pp.91-96, 1973.

E. Gafni and D. Bertsekas, Distributed algorithms for generating loop-free routes in networks with frequently changing topology, Trans. Commun, vol.29, issue.1, pp.11-18, 1981.

P. Gill, N. Jain, and N. Nagappan, Understanding network failures in data centers: measurement, analysis, and implications, SIGCOMM CCR, vol.41, pp.350-361, 2011.

C. Guo, G. Lu, D. Li, H. Wu, X. Zhang et al., Bcube: a high performance, server-centric network architecture for modular data centers, Proc. ACM SIGCOMM, 2009.

P. Hall, On representatives of subsets, Journal of the London Mathematical Society, issue.1, pp.26-30, 1935.

M. Kaufmann and K. Mehlhorn, A linear-time algorithm for the homotopic routing problem in grid graphs, SIAM J. on Computing, vol.23, issue.2, pp.227-246, 1994.

V. Liu, D. Halperin, A. Krishnamurthy, and T. E. Anderson, F10: A fault-tolerant engineered network, Proc. USENIX NSDI, 2013.

A. Markopoulou, G. Iannaccone, S. Bhattacharyya, C. Chuah, and C. Diot, Characterization of failures in an ip backbone, Proc. IEEE INFOCOM, 2004.

Y. Pignolet, S. Schmid, and G. Tredan, Load-optimal local fast rerouting for dependable networks, Proc. DSN, 2017.

S. Schmid and J. Srba, Polynomial-time what-if analysis for prefix-manipulating mpls networks, Proc. IEE INFOCOM, 2018.

A. Shaikh, C. Isett, A. Greenberg, M. Roughan, and J. Gottlieb, A case study of ospf behavior in a large enterprise network, Proc. IMW. ACM, 2002.

B. Stephens, A. L. Cox, and S. Rixner, Plinko: Building provably resilient forwarding tables, Proc. ACM HotNets, 2013.

B. Stephens, A. L. Cox, and S. Rixner, Scalable multi-failure fast failover via forwarding table compression, 2016.

R. Stong, Hamilton decompositions of cartesian products of graphs, Disc. Math, vol.90, issue.2, pp.169-190, 1991.

Y. Wang, H. Wang, A. Mahimkar, R. Alimi, Y. Zhang et al., R3: resilient routing reconfiguration, ACM SGICOMM CCR, vol.40, issue.4, pp.291-302, 2010.

D. Xu, Y. Xiong, C. Qiao, and G. Li, Failure protection in layered networks with shared risk link groups, IEEE network, 2004.