Comparison of proactive and reactive methods for IP fast restoration using localization algorithm

To shorten the time taken to restore an IP network after a failures, we previously proposed a proactive method that uses a localization algorithm to reduce the number of alternate routing tables in the past study. Although we showed that it shortened the restoration time from failures by switching the routing tables to alternate ones set up for handling the failures, deployability remained a problem to be solved. In this paper, we propose a reactive method that enables the step-by-step deployment through the use of a tunneling technique. It also uses the localization algorithm to decide the tunnel's end-point. Experimental results show its easy deployability and smaller computing resource requirements, such as the number of alternate routing tables and required CPU time, compared with the proactive method. Since the reactive method does not require routing table updates at intermediate nodes, it can restore packet reachabilities faster than the proactive method.

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

[2]  Kazuya Suzuki,et al.  Selective Precomputation of Alternate Routes Using Link-State Information for IP Fast Restoration , 2010, IEICE Trans. Commun..

[3]  Chen-Nee Chuah,et al.  Analysis of link failures in an IP backbone , 2002, IMW '02.

[4]  Michael Barbehenn,et al.  A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices , 1998, IEEE Trans. Computers.

[5]  David R. Oran,et al.  OSI IS-IS Intra-domain Routing Protocol , 1990, RFC.

[6]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

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

[8]  Athina Markopoulou,et al.  Characterization of failures in an IP backbone , 2004, IEEE INFOCOM 2004.

[9]  Stewart Bryant,et al.  IP Fast Reroute Using Not-via Addresses , 2006 .

[10]  Kazuya Suzuki,et al.  Formalization and Analysis of Routing Loops by Inconsistencies in IP Forwarding Tables , 2007, IEICE Trans. Commun..

[11]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[12]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[13]  Chen-Nee Chuah,et al.  Feasibility of IP restoration in a tier 1 backbone , 2004, IEEE Network.

[14]  Satish K. Tripathi,et al.  Guest editorial - Protection, restoration, and disoster recovery , 2004, IEEE Network.

[15]  Stein Gjessing,et al.  Fast IP Network Recovery Using Multiple Routing Configurations , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[16]  John Moy,et al.  OSPF Version 2 , 1998, RFC.