## 4 Algorithm Analysis
[CrossRef]
* [PERSON] (2020) [PERSON]; [PERSON] A node-regulated deflection routing framework for contention minimization. _J. Comput. Netw. Commun._**2020**, _2020_, 2708357. [CrossRef]
* [PERSON] et al. (2019) [PERSON]; [PERSON]; [PERSON]; [PERSON] Metro: An efficient traffic fast rerouting scheme with low overhead. _IEEE/ACM Trans. Netw._**2019**, _27_, 2015-2027. [CrossRef]
* [PERSON] et al. (2016) [PERSON]; [PERSON]; [PERSON] Routing optimization for IP networks with loop-free alternates. _Comput. Netw._**2016**, _95_, 35-50. [CrossRef]
* [PERSON] et al. (2013) [PERSON]; [PERSON] [PERSON]; [PERSON] Optimizing IGP link costs for improving IP-level resilience with Loop-Free Alternates. _Comput. Commun._**2013**, _36_, 645-655. [CrossRef]
* [PERSON] et al. (2011) [PERSON]; [PERSON] [PERSON]; [PERSON]; [PERSON] IP fast reroute: Loop free alternates revisited. In Proceedings of the 2011 Proceedings IEEE INFOCOM, Shanghai, China, 10-15 April 2011; pp. 2948-2956. * [PERSON] et al. (2011) [PERSON]; [PERSON]; [PERSON]; [PERSON] On the feasibility and efficacy of protection routing in IP networks. _IEEE/ACM Trans. Netw._**2011**, _19_, 1543-1556. [CrossRef]
* [PERSON] (1998) [PERSON] RFC2328: OSPF Version 2. RFC Editor. 1998. Available online: [[https://www.ietf.org/rfc/rfc2328](https://www.ietf.org/rfc/rfc2328)]([https://www.ietf.org/rfc/rfc2328](https://www.ietf.org/rfc/rfc2328)) (accessed on 6 September 2022). * [PERSON] (1990) [PERSON] RFC1142: Osi Is-Is Intra-Domain Routing Protocol. _The Internet Engineering Task Force._ 1990. Available online: [[https://www.ietf.org/rfc/rfc1142](https://www.ietf.org/rfc/rfc1142)]([https://www.ietf.org/rfc/rfc1142](https://www.ietf.org/rfc/rfc1142)) (accessed on 12 August 2022). * [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] A hybrid link protection scheme for ensuring network service availability in link-state routing networks. _J. Commun. Netw._**2020**, _22_, 46-60. [CrossRef]
* [PERSON] et al. (2025) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Connectivity preserving graph sequences for routing arborescence construction. _IEEE J. Sel. Areas Commun._**2025**, _43_, 484-494. [CrossRef]
* [PERSON] et al. (2021) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] A survey of fast-recovery mechanisms in packet-switched networks. _IEEE Commun. Surv. Tutor._**2021**, _23_, 1253-1301. [CrossRef]
* [PERSON] et al. (2022) [PERSON]; [PERSON]; [PERSON]; [PERSON] Path selection for link failure protection in hybrid SDNs. _Future Gener. Comput. Syst._**2022**, _137_, 201-215. [CrossRef]
* [PERSON] et al. (2023) [PERSON]; [PERSON]; [PERSON] Fault tolerance and failure recovery techniques in software-defined networking: A comprehensive approach. _J. Netw. Syst. Manag._**2023**, _31_, 83. [CrossRef]
* [PERSON] and [PERSON] (2006) [PERSON]; [PERSON] Source selectable path diversity via routing deflections. _ACM SIGCOMM Comput. Commun. Rev._**2006**, _36_, 159-170. [CrossRef]
* [PERSON] and [PERSON] (2009) [PERSON]; [PERSON]; [PERSON] Mara: Maximum alternative routing algorithm. In Proceedings of the IEEE INFOCOM 2009, Rio De Janeiro, Brazil, 19-25 April 2009; pp. 298-306. * [PERSON] et al. (2013) [PERSON]; [PERSON]; [PERSON] Routing with joker links for maximized robustness. In Proceedings of the 2013 IFIP Networking Conference, Brooklyn, NY, USA, 22-24 May 2013; pp. 1-9. * [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON] Hop-by-hop multipath routing: Choosing the right nexthop set. In Proceedings of the IEEE INFOCOM 2020--IEEE Conference on Computer Communications, Toronto, ON, Canada, 6-9 July 2020; pp. 2273-2282. * [PERSON] et al. (2010) [PERSON]; [PERSON]; [PERSON]; [PERSON] [PERSON]; [PERSON] Loop-free alternates and not-via addresses: A proper combination for IP fast reroute? _Comput. Netw._**2010**, _54_, 1300-1315. [CrossRef]
* [PERSON] and [PERSON] (2007) [PERSON]; [PERSON] IP fast rerouting for single-link/node failure recovery.