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

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

A. Shaikh, C. Isett, A. Greenberg, M. Roughan, and J. Gottlieb, A case study of ospf behavior in a large enterprise network, Proc. IMW Workshop at SIGCOMM, pp.217-230, 2002.

J. Tapolcai, B. Vass, Z. Heszberger, J. B?ró, D. Hay et al., A tractable stochastic model of correlated link failures caused by disasters, Proc. IEEE INFOCOM, 2018.
DOI : 10.1109/infocom.2018.8486218

T. Elhourani, A. Gopalan, and S. Ramasubramanian, Ip fast rerouting for multi-link failures, Proc. IEEE INFOCOM, 2014.
DOI : 10.1109/infocom.2014.6848157

A. K. Atlas and A. Zinin, Basic specification for ip fast-reroute: loopfree alternates, IETF RFC, vol.5286, 2008.

. Telemark, Survey, 2006.

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

J. Liu, A. Panda, A. Singla, B. Godfrey, M. Schapira et al., Ensuring connectivity via data plane mechanisms, Proc. NSDI, 2013.

A. Vahdat, D. Clark, and J. Rexford, A purpose-built global network: Google's move to sdn, Commun. ACM, vol.59, issue.3, pp.46-54, 2016.

J. Feigenbaum, B. Godfrey, A. Panda, M. Schapira, S. Shenker et al., Ba: On the resilience of routing tables, 2012.

M. Chiesa, A. V. Gurtov, A. Madry, S. Mitrovic, I. Nikolaevskiy et al., On the resiliency of randomized routing against multiple edge failures, Proc. ICALP, 2016.

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

Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Racke, Optimal oblivious routing in polynomial time, Proc. STOC, 2003.
DOI : 10.1016/j.jcss.2004.04.010
URL : https://doi.org/10.1016/j.jcss.2004.04.010

J. Wang and S. Nelakuditi, Ip fast reroute with failure inferencing, Proc. SIGCOMM Workshop on Internet Network Management, 2007.
DOI : 10.1145/1321753.1321764

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.

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

M. Borokhovich and S. Schmid, How (not) to shoot in your foot with sdn local fast failover: A load-connectivity tradeoff, OPODIS, 2013.
DOI : 10.1007/978-3-319-03850-6_6

K. Foerster, Y. Pignolet, S. Schmid, and G. Tredan, Local fast failover routing with low stretch, ACM SIGCOMM CCR, vol.1, pp.35-41, 2018.
DOI : 10.1145/3211852.3211858
URL : https://hal.archives-ouvertes.fr/hal-02043783

P. N. Klein and D. Marx, A subexponential parameterized algorithm for subset tsp on planar graphs, Proc. SODA, 2014.
DOI : 10.1137/1.9781611973402.131

S. Akhoondian-amiri, K. Foerster, and S. Schmid, Walking through waypoints, Proc. LATIN, 2018.

B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms, 2012.

T. Elhourani, A. Gopalan, and S. Ramasubramanian, Ip fast rerouting for multi-link failures, IEEE/ACM Trans. Netw, vol.24, issue.5, pp.3014-3025, 2016.

J. Edmonds, Edge-disjoint branchings, Combinatorial algorithms, vol.9, p.2, 1973.

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

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

J. Yang, S. Tang, J. Chang, and Y. Wang, Parallel construction of optimal independent spanning trees on hypercubes, Parallel Computing, vol.33, issue.1, pp.73-79, 2007.

X. Chen, Parallel construction of optimal independent spanning trees on cartesian product of complete graphs, Information Processing Letters, vol.111, issue.5, pp.235-238, 2011.

J. Yang and J. Chang, Optimal independent spanning trees on cartesian product of hybrid graphs, The Computer Journal, vol.57, issue.1, pp.93-99, 2014.

J. Kim, H. Lee, E. Cheng, and L. Lipták, Independent spanning trees on even networks, Information Sciences, vol.181, issue.13, pp.2892-2905, 2011.

, Optimal independent spanning trees on odd graphs, The Journal of Supercomputing, vol.56, issue.2, pp.212-225, 2011.

M. Chiesa, I. Nikolaevskiy, S. Mitrovic, A. Panda, A. Gurtov et al., The quest for resilient (static) forwarding tables, Proc. IEEE INFOCOM, 2016.

N. Spring, R. Mahajan, D. Wetherall, and T. Anderson, Measuring ISP topologies with rocketfuel, IEEE/ACM Trans. Netw, vol.12, issue.1, pp.2-16, 2004.

E. Gafni and D. Bertsekas, Distributed algorithms for generating loopfree routes in networks with frequently changing topology, IEEE Transactions on, vol.29, issue.1, pp.11-18, 1981.

C. Busch, S. Surapaneni, and S. Tirthapura, Analysis of link reversal routing algorithms for mobile ad hoc networks, Proc. SPAA, 2003.

M. Canini, P. Kuznetsov, D. Levin, and S. Schmid, A Distributed and Robust SDN Control Plane for Transactional Network Updates, Proc. IEEE INFOCOM, 2015.

K. Foerster, M. Parham, M. Chiesa, and S. Schmid, TI-MFA: keep calm and reroute segments fast, Proc. IEEE Global Internet Symposium, 2018.

K. Foerster, M. Parham, S. Schmid, and T. Wen, Local fast segment rerouting on hypercubes, Proc. OPODIS, 2018.

P. Hande, M. Chiang, R. Calderbank, and S. Rangan, Network pricing and rate allocation with content-provider participation, Proc. IEEE INFOCOM, 2010.

T. Holterbach, E. C. Molero, M. Apostolaki, A. Dainotti, S. Vissicchio et al., Blink: Fast connectivity recovery entirely in the data plane, Proc. NSDI, 2019.

H. H. Liu, S. Kandula, R. Mahajan, M. Zhang, and D. Gelernter, Traffic engineering with forward fault correction, Proc. SIGCOMM, 2014.

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

, Scalable multi-failure fast failover via forwarding table compression, 2016.

M. Borokhovich, Y. A. Pignolet, S. Schmid, and G. Tredan, Loadoptimal local fast rerouting for dense networks, IEEE/ACM Trans. Netw, vol.26, issue.6, pp.2583-2597, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02043798

G. Malewicz, A. Russell, and A. A. Shvartsman, Distributed scheduling for disconnected cooperation, Distr. Comp, vol.18, issue.6, pp.409-420, 2005.