Network resilience through multi-topology routing

In this paper we propose the use of multi-topology (MT) routing for network resilience against link and node failures. We describe the multi-topologies by an n-dimensional vector of different link costs for all links in the network. It is the base for the calculation of n shortest path trees from any node to all other destinations, i.e. for n virtual routing topologies. We define the link costs in such a way that the routing topologies complement each other in the sense that at least one valid route remains in a single link or node failure scenario for each pair of nodes in at least one routing topology. In such a failure case, packets are rather deviated over the intact routing topology than discarded. The recovery speed of the presented mechanism is very fast and can be compared to fast rerouting mechanisms in MPLS, which reduce packet drops to a minimum. In contrast to MPLS, MT routing is still a pure IP-based solution that retains the scalability and the robustness of IP routing.

[1]  Michael Menth,et al.  Self-Protecting Multipaths - A Simple and Resource-Effcient Protection Switching Mechanism for MPLS Networks , 2004, NETWORKING.

[2]  Unrecognized.  Multi-topology routing in OSPFv3 (MT-OSPFv3) , 2007 .

[3]  Michael Menth,et al.  Efficient admission control and routing for resilient communication networks , 2004 .

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

[5]  Ellen W. Zegura,et al.  Performance of hashing-based schemes for Internet load balancing , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  A. Todimala,et al.  IMSH: an iterative heuristic for SRLG diverse routing in WDM mesh networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[7]  Joachim Charzinski,et al.  Towards carrier-grade next generation networks , 2003, International Conference on Communication Technology Proceedings, 2003. ICCT 2003..

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

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

[10]  Jian-Qiang Hu,et al.  Diverse routing in optical mesh networks , 2003, IEEE Trans. Commun..

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

[12]  Andreas Kirstädter,et al.  Engineering end-to-end IP resilience using resilience-differentiated QoS , 2002, IEEE Commun. Mag..

[13]  Ross W. Callon,et al.  Use of OSI IS-IS for routing in TCP/IP and dual environments , 1990, RFC.

[14]  Gero Dittmann,et al.  Network Processor Load Balancing for High-Speed Links , 2000 .

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

[16]  Stein Gjessing,et al.  Applicability of Resilient Routing Layers for k-Fault Network Recovery , 2005, ICN.

[17]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

[19]  Biswanath Mukherjee,et al.  Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints , 2003, TNET.