Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks

The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long-haul networks. Previously, the spare capacity of a network with a given set of working span sizes has been optimized to facilitate span restoration. Path restorable networks can, however, be even more efficient by defining the restoration problem from an end to end rerouting viewpoint. We provide a method for capacity optimization of path restorable networks which is applicable to both synchronous transfer mode (STM) and asynchronous transfer mode (ATM) virtual path (VP)-based restoration. Lower bounds on spare capacity requirements in span and path restorable networks are first compared, followed by an integer program formulation based on flow constraints which solves the spare and/or working capacity placement problem in either span or path restorable networks. The benefits of path and span restoration, and of jointly optimizing working path routing and spare capacity placement, are then analyzed.

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

[2]  Wayne D. Grover,et al.  Two strategies for spare capacity placement in mesh restorable networks , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

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

[4]  Ken-ichi Sato,et al.  Self-healing ATM networks based on virtual path concept , 1994, IEEE J. Sel. Areas Commun..

[5]  Wayne D. Grover,et al.  Dependence of network capacity requirements on the allowable flow convergence overloads in ATM backup VP restoration , 1997 .

[6]  H. Eslambolchi,et al.  FASTAR-a robust system for fast DS3 restoration , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[7]  Alexander Gersht,et al.  Dynamic bandwidth-allocation and path-restoration in SONET self-healing networks , 1996, IEEE Trans. Reliab..

[8]  Keiji Miyazaki,et al.  Distributed self‐healing network and its optimum spare‐capacity assignment algorithm , 1991 .

[9]  Tsong-Ho Wu.  A passive protected self-healing mesh network architecture and applications , 1994, TNET.

[10]  C. H. Yang,et al.  FITNESS-failure immunization technology for network services survivability , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.

[11]  Wayne Davy Grover.  Self-healing networks: a distributed algorithm fork-shortest link-disjoint paths in a multigraph with applications in real-time network restoration , 1989 .

[12]  Liang T. Wu,et al.  Using distributed topology update and preplanned configurations to achieve trunk network survivability , 1991 .

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

[14]  W. D. Grover,et al.  The selfhealing network : A fast distributed restoration technique for networks using digital crossconnect machines , 1987 .

[15]  M. Herzberg,et al.  An optimal spare-capacity assignment model for survivable networks with hop limits , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

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

[17]  Iraj Saniee,et al.  Optimal Routing Designs in Self-healing Communications Networks , 1996 .

[18]  S. Vajda,et al.  Integer Programming and Network Flows , 1970 .

[19]  Rainer R. Iraschko.  Path restorable networks , 1997 .

[20]  M. Gerla,et al.  Protection planning in transmission networks , 1992, [Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications.

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

[22]  Bradley David. Venables.  Algorithms for the spare capacity design of mesh restorable networks , 1992 .

[23]  J. E. Baker,et al.  A distributed link restoration algorithm with robust preplanning , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.