Multiple Routing Configurations for Fast IP Network Recovery

As the Internet takes an increasingly central role in our communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC). Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. MRC is strictly connectionless, and assumes only destination based hop-by-hop forwarding. MRC is based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure. It can be implemented with only minor changes to existing solutions. In this paper we present MRC, and analyze its performance with respect to scalability, backup path lengths, and load distribution after a failure. We also show how an estimate of the traffic demands in the network can be used to improve the distribution of the recovered traffic, and thus reduce the chances of congestion when MRC is used.

[1]  Abhijit Bose,et al.  Delayed Internet routing convergence , 2000, SIGCOMM.

[2]  Mikkel Thorup,et al.  Robust optimization of OSPF/IS-IS weights , 2003 .

[3]  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.

[4]  Kai-Yeung Siu,et al.  Restoration methods for traffic engineered networks with loop-free routing guarantees , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[5]  Athina Markopoulou,et al.  Characterization of Failures in an IP Backbone Network , 2004, INFOCOM.

[6]  Roch Guérin,et al.  Making IGP Routing Robust to Link Failures , 2005, NETWORKING.

[7]  M.J. O'Mahony,et al.  Results from the COST 239 project. Ultra-High Capacity Optical Transmission Networks , 1996, Proceedings of European Conference on Optical Communication.

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

[9]  Donald F. Towsley,et al.  On distinguishing between Internet power law topology generators , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[11]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[12]  Roch Guérin,et al.  Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2005, IEEE/ACM Transactions on Networking.

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

[14]  David D. Clark,et al.  The design philosophy of the DARPA internet protocols , 1988, SIGCOMM '88.

[15]  Jon G. Riecke,et al.  Stability issues in OSPF routing , 2001, SIGCOMM.

[16]  Stein Gjessing,et al.  Resilient routing layers for recovery in packet networks , 2005, 2005 International Conference on Dependable Systems and Networks (DSN'05).

[17]  Peter Psenak.  MT-OSPF: Multi Topology (MT) Routing in OSPF , 2004 .

[18]  Chen-Nee Chuah,et al.  Failure Inferencing Based Fast Rerouting for Handling Transient Link and Node Failures , 2005, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[19]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[20]  M. Menth,et al.  Network resilience through multi-topology routing , 2005, DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005..

[21]  Olivier Bonaventure,et al.  Disruption Free Topology Reconfiguration in OSPF Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[22]  Biswanath Mukherjee,et al.  IP resilience within an autonomous system: current approaches, challenges, and future directions , 2005, IEEE Communications Magazine.

[23]  Christophe Diot,et al.  Impact of link failures on VoIP performance , 2002, NOSSDAV '02.

[24]  Zheng Wang,et al.  Internet traffic engineering without full mesh overlaying , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[26]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

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

[29]  Christophe Diot,et al.  An approach to alleviate link overload as observed on an IP backbone , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[30]  Kai-Yeung Siu,et al.  Local restoration algorithm for link-state routing protocols , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[31]  Oliver C. Ibe,et al.  A survey of IP and multiprotocol label switching fast reroute schemes , 2007, Comput. Networks.

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

[33]  David Watson,et al.  Experiences with monitoring OSPF on a regional service provider network , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[34]  Bianca Schroeder,et al.  IGP link weight assignment for transient link failures , 2003 .

[35]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[36]  Stein Gjessing,et al.  Fast recovery from link failures using resilient routing layers , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

[37]  Stein Gjessing,et al.  Post-Failure Routing Performance with Multiple Routing Configurations , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[38]  Olav Lysne,et al.  FRoots: A Fault Tolerant and Topology-Flexible Routing Technique , 2006, IEEE Transactions on Parallel and Distributed Systems.