Successive survivable routing for node failures

This paper addresses the spare capacity allocation (SCA) problem considering any single node failure in mesh networks. The SCA node failure problem aims at finding backup routes and providing sufficient spare capacity to protect traffic when any single node fails in a communication network. Here, we introduce our novel matrix formulation of the arc-flow SCA node failure model. In this model, working paths are given before pre-planned backup paths are routed and reserved. Because backup paths can not be guaranteed if general shortest path routing of working paths is used, we give a graph algorithm to find the working path which has at least one node-disjoint backup path. We extend our recent approximation algorithm, successive survivable routing (SSR), to solve the above SCA model. Numerical comparison shows that SSR has the best trade-off between solution optimality and computation speed.

[1]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

[3]  Salah Aidarous,et al.  Distributed Restoration of the Transport Network , 1994 .

[4]  W. D. Grover,et al.  Comparative Methods and Issues In Design of Mesh-Restorable STM and ATM Networks , 1999 .

[5]  Jeffery L. Kennington,et al.  Fault restoration and spare capacity allocation with QoS constraints for MPLS networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

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

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

[8]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks. Part I-Protection , 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).

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

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

[11]  Filip De Turck,et al.  Dimensioning of survivable WDM networks , 1998, IEEE J. Sel. Areas Commun..

[12]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks , 1998, TNET.

[13]  L. Foulds,et al.  Graph Theory Applications , 1991 .

[14]  Parameswaran Ramanathan,et al.  Resource aggregation for fault tolerance in integrated services networks , 1998, CCRV.

[15]  Chung-Lun Li,et al.  Finding disjoint paths with different path-costs: Complexity and algorithms , 1992, Networks.

[16]  Tsong-Ho Wu,et al.  Fiber Network Service Survivability , 1992 .

[17]  Xun Su,et al.  An online distributed protection algorithm in WDM networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[18]  Masayuki Murata,et al.  Design Method for Highly Reliable Virtual Path Based ATM Networks , 1996 .

[19]  Tsong-Ho Wu,et al.  Emerging technologies for fiber network survivability , 1995, IEEE Commun. Mag..