Spare Capacity Allocation

This chapter introduces spare capacity allocation schemes performed either off-line for a static deployment, or on-line during a time interval between two consecutive network events (i.e., a connection setup or tear-down). As survivability becomes one of the most important issues in the design of control and management of WDM networks, development of protection and restoration schemes became critical to network applicability and/or revenue-making capability. As mentioned in Chapter 6, pre-planning or pre-configuration of spare capacity for some working paths with stringent quality-of-service requirements, are the most commonly seen approaches for achieving this goal. However, if the allocation of spare capacity cannot be both capacity- and computation-efficient, the applicability of the algorithms may be limited, and the network cost for control and management increased. Therefore, we need to develop a spare capacity allocation scheme which meets the requirements of computation-efficiency, capacity-efficiency, class of service, and adaptability to traffic variation.

[1]  Ori Gerstel,et al.  Protection interoperability for WDM optical networks , 2000, TNET.

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

[3]  Thomas E. Stern,et al.  Protection cycles in mesh WDM networks , 2000, IEEE Journal on Selected Areas in Communications.

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

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

[6]  Narsingh Deo,et al.  On Algorithms for Enumerating All Circuits of a Graph , 1976, SIAM J. Comput..

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

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

[9]  W. D. Grover,et al.  Optimized design of ring-based survivable networks , 1995, Canadian Journal of Electrical and Computer Engineering.

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