Fast Recovery From Dual-Link or Single-Node Failures in IP Networks Using Tunneling

cormen, 2001, Introduction to Algorithms

balasubramanian, 2006, Minimizing average path delay in colored trees for multipath routing, Proc IEEE ICCCNSensors Ad Hoc Netw Symp, 566

10.1109/JSAC.2003.816597

10.17487/rfc2003

2002, Intermediate System to Intermediate System Routing Information Exchange Protocol for Use in Conjunction With the Protocol for Providing the Connectionless-Mode Network Service (ISO 8473)

2002, International Standard

10.17487/rfc5286

10.1109/HPSR.2004.1303507

narvaez, 1999, efficient algorithms for multi-path link state routing, Proceedings of ISCOM

10.1109/ICC.2001.937183

10.1109/ISCC.2005.150

10.17487/rfc5714

nelakuditi, 2003, failure insensitive routing for ensuring service availability, Proc IWQoS, 287

lane, 1937, a structural characterization of planar combinatorial graphs, Duke Math J, 3, 460, 10.1215/S0012-7094-37-00336-3

lee, 2004, proactive vs. reactive approaches to failure resilient routing, Proc IEEE InfoCom, 1, 176

10.1137/0202012

10.1109/INFOCOM.2006.227

10.1109/HPSR.2003.1226686

10.1137/0222002

10.1016/j.comnet.2006.11.029

10.1145/1070873.1070877

ward, 2010, Bidirectional Forwarding Detection

shand, 2010, IP fast reroute using not-via addresses

10.1109/INFCOM.2004.1354653

10.1109/INFCOM.2009.5062052

10.1109/ICC.2007.28

10.17487/rfc3931

10.17487/rfc1701

bryant, 2008, IPFRR in the presence of multiple failures

10.1145/1364654.1364688

10.1109/TNET.2008.919323

ramasubramanian, 2006, distributed linear time construction of colored trees for disjoint multipath routing, Proc IFIP Netw, 1026