A novel dynamic fault restoration mechanism using cluster allocation approach in WDM mesh networks

This work describes a novel distributed algorithm, called the Cluster Allocation Algorithm (CAA), for the restoration scheme in a WDM mesh network. The nodes search for neighboring nodes and establish the relationship between them to build numerous logical clusters. Each cluster has a unique manager, called Cluster Head (CH) that searches for routing path, wavelength assignment (RWA) and restoration paths upon receiving requests from its cluster members. Some clusters might comprise only one CH, and cluster members in each cluster can be directly connected to CH. The communication among clusters is also negotiated through the manager. The selected restoration path is pre-computed from the CH to the destination node with the minimum cost function. Therefore, restoration paths can be sought with quick assignment of wavelength routings when the link, node or channel failure occurs based on the status of traffic load, number of nodes and transmission time. The primary aim of this work is to use clusters near faults to share the restoration load throughout the mesh network. The system performance of the CAA is compared with p-cycle, double cycle and DMRA methodologies in terms of restoration time and non-restoration ratio.

[1]  Joseph Kiniry.  Wavelength Division Multiplexing: Ultra High Speed Fiber Optics , 1998, IEEE Internet Comput..

[2]  Biswanath Mukherjee,et al.  A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..

[3]  Charles A. Brackett,et al.  Dense Wavelength Division Multiplexing Networks: Principles and Applications , 1990, IEEE J. Sel. Areas Commun..

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

[5]  András Kern,et al.  Surviving multiple network failures using shared backup path protection , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[6]  Tzu-Jane Tsai,et al.  A access-based clustering protocol for multihop wireless ad hoc networks , 2001, IEEE J. Sel. Areas Commun..

[7]  Wayne D. Grover,et al.  A highly efficient path-restoration protocol for management of optical network transport integrity , 2000, IEEE Journal on Selected Areas in Communications.

[8]  Murat Azizoglu,et al.  Dynamic route selection and wavelength assignment in all-optical networks , 1995, LEOS '95. IEEE Lasers and Electro-Optics Society 1995 Annual Meeting. 8th Annual Meeting. Conference Proceedings.

[9]  Mario Martinelli,et al.  Optical Network Survivability: Protection Techniques in the WDM Layer , 2002, Photonic Network Communications.

[10]  Krishna P. Gummadi,et al.  An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks , 2003, TNET.

[11]  C.S.R. Murthy,et al.  Segmented protection paths in WDM mesh networks , 2003, Workshop on High Performance Switching and Routing, 2003, HPSR..

[12]  I-Shyan Hwang,et al.  A novel dynamic fault restoration mechanism using multiple rings approach in WDM mesh network , 2003, CLEO/Pacific Rim 2003. The 5th Pacific Rim Conference on Lasers and Electro-Optics (IEEE Cat. No.03TH8671).

[13]  Kyungsik Lee,et al.  Optimal routing and wavelength assignment in WDM ring networks , 2000, IEEE Journal on Selected Areas in Communications.

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

[15]  I-Shyan Hwang,et al.  A Novel Dynamic Fault Restoration Mechanism Using a Multiple Ring Approach in WDM Mesh Networks , 2005, Photonic Network Communications.

[16]  Masayuki Murata,et al.  Lightpath Management of Logical Topology with Incremental Traffic Changes for Reliable IP over WDM Networks , 2002 .