Failure-oriented path restoration algorithm for survivable networks

A new polynomial-time approximation algorithm called service path local optimization (SPLO) is presented. SPLO is shown to perform competitively with existing non-polynomial approximations based on the failure-oriented approach. SPLO is designed for online computation where only one request is computed at a time, and the decision making does not depend on future requests. The polynomial-time and online nature of the algorithm makes SPLO suitable for use in real-time on-demand path request applications. In addition, a non-polynomial approximation algorithm based on SPLO called nSPLO is proposed. Result shows that spare capacity is reduced significantly but at the cost of substantially higher computation run-time. The paper also introduces a new concept called path intermix where the service path's allocated bandwidth can be used by the backup paths protecting that particular service path. The result shows that path intermix can reduce spare capacity by up to 5% for single node failure.

[1]  G. Swallow.  MPLS advantages for traffic engineering , 1999, IEEE Commun. Mag..

[2]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[3]  Robert D. Doverspike,et al.  Efficient distributed path selection for shared restoration connections , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  Lorne Mason,et al.  Restoration strategies and spare capacity requirements in self-healing ATM networks , 1999, TNET.

[5]  Vijay Srinivasan,et al.  RSVP-TE: Extensions to RSVP for LSP Tunnels , 2001, RFC.

[6]  Jim Boyle,et al.  Applicability Statement for Traffic Engineering with MPLS , 2002, RFC.

[7]  Robert D. Doverspike,et al.  Efficient distributed restoration path selection for shared mesh restoration , 2003, TNET.

[8]  Hideki Sakauchi,et al.  A self-healing network with an economical spare-channel assignment , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[9]  Yu Liu,et al.  Spare Capacity Allocation for Non-Linear Link Cost and Failure-Dependent Path Restoration , 2001 .

[10]  Hyong S. Kim,et al.  Joint optimization of capacity and flow assignment for self-healing ATM networks , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[11]  Vishal Sharma,et al.  Framework for Multi-Protocol Label Switching (MPLS)-based Recovery , 2003, RFC.

[12]  Lorne Mason,et al.  Restoration strategies and spare capacity requirements in self-healing ATM networks , 1997, Proceedings of INFOCOM '97.

[13]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[14]  Lou Berger,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Signaling Resource ReserVation Protocol-Traffic Engineering (RSVP-TE) Extensions , 2003, RFC.

[15]  M. Herzberg,et al.  The hop-limit approach for spare-capacity assignment in survivable networks , 1995, TNET.

[16]  Yu Liu,et al.  Approximating optimal spare capacity allocation by successive survivable routing , 2001, IEEE/ACM Transactions on Networking.

[17]  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).

[18]  Wayne D. Grover,et al.  Comparison of k-shortest paths and maximum flow routing for network facility restoration , 1994, IEEE J. Sel. Areas Commun..

[19]  Lou Berger,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Signaling Functional Description , 2003, RFC.

[20]  Lou Berger,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Signaling Constraint-based Routed Label Distribution Protocol (CR-LDP) Extensions , 2003, RFC.

[21]  Ariel Orda,et al.  Algorithms for computing QoS paths with restoration , 2005, IEEE/ACM Transactions on Networking.

[22]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in mesh survivable networks , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[23]  Murali S. Kodialam,et al.  Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information , 2003, TNET.