Tunneling on demand: A lightweight approach for IP fast rerouting against multi-link failures

Multi-link failures in the Internet may incur heavy packet loss and degrade the network performance. Existing approaches have been proposed to address this issue by enabling routing protections. However, the effectiveness and efficiency issues of these approaches are not well addressed. In particular, it has not been answered that whether label-free routing can provide full protection against arbitrary multi-link failures in any networks. We propose a model for interface-specific-routing (ISR) which can be seen as a general label-free routing. We present that there exist some networks in which no ISR can be constructed to protect the routing against any k-link failures (k ≥ 2). To improve the protection effectiveness with little overhead in such cases, we propose a tunneling on demand (TOD) approach in this paper. With our approach, most failures can be covered by ISR, and tunneling is activated only when failures cannot be detoured around by ISR. We develop algorithms to compute ISR properly so as to minimize the number of activated tunnels, and compute the protection tunnels if necessary. We prove that TOD can protect routing against any single-link failures and dual-link failures. We evaluate TOD by simulations with real world topologies. The results show that TOD can achieve a protection ratio higher than 98% with small tunneling overhead for multi-link failures, better than existing tunnel-free approach whose protection ratio is 85% to 95%.

[1]  Alia Atlas,et al.  Basic Specification for IP Fast Reroute: Loop-Free Alternates , 2008, RFC.

[2]  Marwan Krunz,et al.  Disjoint multipath routing using colored trees , 2007, Comput. Networks.

[3]  Xingang Shi,et al.  Dynamic distributed algorithm for computing multiple next-hops on a tree , 2013, 2013 21st IEEE International Conference on Network Protocols (ICNP).

[4]  Dave Katz,et al.  Bidirectional Forwarding Detection (BFD) for IPv4 and IPv6 (Single Hop) , 2010, RFC.

[5]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[6]  Olivier Bonaventure,et al.  Achieving sub-second IGP convergence in large IP networks , 2005, CCRV.

[7]  Gábor Rétvári,et al.  IP fast ReRoute: Loop Free Alternates revisited , 2011, 2011 Proceedings IEEE INFOCOM.

[8]  Olivier Bonaventure,et al.  An evaluation of IP-based fast reroute techniques , 2005, CoNEXT '05.

[9]  Olivier Bonaventure,et al.  An efficient algorithm to enable path diversity in link state routing networks , 2011, Comput. Networks.

[10]  Pierre François,et al.  Improving the convergence of IP routing protocols , 2007 .

[11]  Xiaowei Yang,et al.  On improving the efficiency and manageability of NotVia , 2007, CoNEXT '07.

[12]  Mingwei Xu,et al.  Selecting shorter alternate paths for tunnel-based IP Fast ReRoute in linear time , 2012, Comput. Networks.

[13]  Alia Atlas,et al.  Fast Reroute Extensions to RSVP-TE for LSP Tunnels , 2005, RFC.

[14]  Srihari Nelakuditi,et al.  Failure insensitive routing for ensuring service availability , 2003, IWQoS'03.

[15]  Zhi-Li Zhang,et al.  On the Feasibility and Efficacy of Protection Routing in IP Networks , 2010, IEEE/ACM Transactions on Networking.

[16]  Srihari Nelakuditi,et al.  Handling Multiple Failures in IP Networks through Localized On-Demand Link State Routing , 2012, IEEE Transactions on Network and Service Management.

[17]  Chen-Nee Chuah,et al.  Characterization of Failures in an Operational IP Backbone Network , 2008, IEEE/ACM Transactions on Networking.

[18]  Junda Liu,et al.  Keep Forwarding: Towards k-link failure resilient routing , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[19]  Minas Gjoka,et al.  Evaluation of IP Fast Reroute Proposals , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.

[20]  Jennifer Rexford,et al.  Toward internet-wide multipath routing , 2008, IEEE Network.

[21]  Scott Shenker,et al.  Achieving convergence-free routing using failure-carrying packets , 2007, SIGCOMM '07.

[22]  Stewart Bryant,et al.  IP Fast Reroute Framework , 2010, RFC.

[23]  Amund Kvalbein,et al.  Fast Recovery From Dual-Link or Single-Node Failures in IP Networks Using Tunneling , 2010, IEEE/ACM Transactions on Networking.

[24]  Jianping Wu,et al.  RPFP: IP fast reroute with providing complete protection and without using tunnels , 2013, 2013 IEEE/ACM 21st International Symposium on Quality of Service (IWQoS).

[25]  Chen-Nee Chuah,et al.  Fast Local Rerouting for Handling Transient Link Failures , 2007, IEEE/ACM Transactions on Networking.

[26]  Michael Menth,et al.  Loop-free alternates and not-via addresses: A proper combination for IP fast reroute? , 2010, Comput. Networks.

[27]  Kai-Yeung Siu,et al.  Routing reconfiguration in ip networks , 2000 .

[28]  G. Jayavelu,et al.  Maintaining Colored Trees for Disjoint Multipath Routing Under Node Failures , 2009, IEEE/ACM Transactions on Networking.

[29]  Kai-Yeung Siu,et al.  New dynamic SPT algorithm based on a ball-and-string model , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).