Preprovisioning networks to support fast restoration with minimum over-build

Supporting fast restoration for general mesh topologies with minimal network over build is a technically challenging problem. Traditionally, ring based SONET networks have offered 50 ms restoration at the cost of requiring 100% over-build. Recently, fast (local) reroute has gained momentum in the context of MPLS networks. Fast reroute, when combined with preprovisioning of protection capacities and bypass tunnels, comes close to providing fast restoration for mesh networks. Preprovisioning has the additional advantage of greatly simplifying network routing and signaling. Thus even for protected connections, online routing can now be oblivious to the offered protection, and may only involve single shortest path computations. In this paper we are interested in the problem of reserving the least amount of the network capacity for protection, while guaranteeing fast restoration to all the supported connections. We show that the problem is NP-complete, and we present efficient approximation algorithms for the problem. These guarantees are provided even when the protection is for multiple link failures. In addition, the total amount of protection capacity reserved by these algorithms is just a small fraction of the amount reserved by existing ring-based schemes (e.g. SONET), especially on dense networks. The presented algorithms are computationally efficient, and can even be implemented on the network elements. Our simulation on some standard core networks, show that our algorithms work well in practice as well.

[1]  Jean-Louis Le Roux.  A method for an Optimized Online Placement of MPLS Bypass Tunnels , 2002 .

[2]  Muriel Médard,et al.  WDM loop-back recovery in mesh networks , 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).

[3]  Wayne D. Grover,et al.  Case studies of survivable ring, mesh and mesh-arc hybrid networks , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.

[4]  Stefaan De Cnodder.  Backup Record Route for Fast Reroute Techniques in RSVP-TE , 2002 .

[5]  Achim Autenrieth,et al.  Survivability of Multiple Fiber Duct Failures , 2001 .

[6]  Wayne D. Grover,et al.  Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[7]  Murali S. Kodialam,et al.  Dynamic routing of bandwidth guaranteed tunnels with restoration , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Thomas E. Stern,et al.  Automatic protection switching for link failures in optical networks with bi-directional links , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[9]  John P. Fonseka,et al.  Hierarchical self-healing rings , 1995, TNET.

[10]  Suresh Subramaniam,et al.  On double-link failure recovery in WDM optical networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Murali S. Kodialam,et al.  Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[12]  Yakov Rekhter,et al.  Mpls: Technology and Applications , 2000 .

[13]  Joseph Naor,et al.  Building Edge-Failure Resilient Networks , 2002, IPCO.

[14]  Muriel Médard,et al.  Generalized loop-back recovery in optical mesh networks , 2002, TNET.

[15]  Wayne D. Grover,et al.  Availability analysis of span-restorable mesh networks , 2002, IEEE J. Sel. Areas Commun..

[16]  T. V. Lakshman,et al.  Shared backup Label Switched Path restoration , 2001 .

[17]  Ramki Krishnan,et al.  A Method for Setting an Alternative Label Switched Paths to Handle Fast Reroute , 2000 .

[18]  Carsten Thomassen.  On the Complexity of Finding a Minimum Cycle Cover of a Graph , 1997, SIAM J. Comput..