The cycle-oriented approach: a pragmatic concept for resource allocation in multiservice survivable networks

The development of multiservice provisioning platforms and multitechnology network-management systems augment the need for advanced network tools to accommodate effectively the complex task of managing devices, systems and services that are supported by the network. Assignment of common transport network resources for the proper functionality of the services when using such tools requires the selection of a suitable approach for handling both working and redundant resources of survivable networks according to predefined service-dependent requirements. Specifically, it is essential to address planning and operational aspects that are driven by policy-based management to provide differential survivability in a multiservice network environment. We suggest a generic approach for the cost-effective resource-allocation task, especially appropriate for wide area networks, that meets a broad range of service-quality requirements associated with specified heterogeneous survivable traffic types under both normal operations and network failure conditions.

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

[2]  Robert D. Doverspike,et al.  Comparison of capacity efficiency of DCS network restoration routing techniques , 1994, Journal of Network and Systems Management.

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

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

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

[6]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[7]  M. Herzberg,et al.  Optimal resource allocation for path restoration in mesh-type self-healing networks , 1997 .

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