Restoration strategies and spare capacity requirements in self-healing ATM networks

This paper studies the capacity and flow assignment problem arising in the design of self-healing asynchronous transfer mode (ATM) networks using the virtual path concept. The problem is formulated here as a linear programming problem which is solved using standard methods. The objective is to minimize the spare capacity cost for the given restoration requirement. The spare cost depends on the restoration strategies used in the network. We compare several restoration strategies quantitatively in terms of spare cost, notably: global versus failure-oriented reconfiguration, path versus link restoration, and state-dependent versus state-independent restoration. The advantages and disadvantages of various restoration strategies are also highlighted. Such comparisons provide useful guidance for real network design. Further, a new heuristic algorithm based on the minimum cost route concept is developed for the design of large self-healing ATM networks using path restoration. Numerical results illustrate that the heuristic algorithm is efficient and gives near-optimal solutions for the spare capacity allocation and flow assignment for tested examples.

[1]  J. Bicknell,et al.  A fast distributed network restoration algorithm , 1993, Proceedings of Phoenix Conference on Computers and Communications.

[2]  Moshe Dror,et al.  Fiberoptic circuit network design under reliability constraints , 1989, IEEE J. Sel. Areas Commun..

[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.  Near optimal spare capacity planning in a mesh restorable network , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

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

[7]  Subrahmanyam Dravida,et al.  Fast restoration of ATM networks , 1994, IEEE J. Sel. Areas Commun..

[8]  A. Gersht,et al.  Optimal dynamic virtual path bandwidth allocation and restoration in ATM networks , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[9]  P. A. Veitch,et al.  Design and performance issues of protection virtual path networks , 1996 .

[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]  Lorne Mason,et al.  Restoration strategies and spare capacity requirements in self-healing ATM networks , 1997, Proceedings of INFOCOM '97.

[12]  Aurel A. Lazar,et al.  Virtual path control for ATM networks with call level quality of service guarantees , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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

[14]  Wayne D. Grover,et al.  Fast heuristic principle for spare capacity placement in mesh-restorable SONET/SDH transport networks , 1997 .

[15]  Yijun Xiong,et al.  On state-independent and state-dependent path restoration in self-healing networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

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

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

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

[19]  Joseph Sosnosky,et al.  Service applications for SONET DCS distributed restoration , 1994, IEEE J. Sel. Areas Commun..

[20]  Zbigniew Dziong,et al.  Virtual network concept and its applications for resource management in ATM based networks , 1996 .

[21]  M. Minoux,et al.  Subgradient optimization and large scale programming : an application to optimum multicommodity network synthesis with security constraints , 1981 .

[22]  Keiji Miyazaki,et al.  A distributed restoration algorithm for multiple-link and node failures of transport networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[23]  Deep Medhi,et al.  A unified approach to network survivability for teletraffic networks: models, algorithms and analysis , 1994, IEEE Trans. Commun..