A Novel Dynamic Fault Restoration Mechanism Using a Multiple Ring Approach in WDM Mesh Networks

Abstract

This work describes a distributed fault restoration algorithm, called the Dynamic Multiple Ring Algorithm (DMRA), for application in WDM mesh networks. This study explores the choice of restoration paths and the assignment of fault-tolerant bandwidth when a link, node, or channel failure occurs according to the change in traffic load, number of nodes, and transmission delay including propagation and switching delays. Accordingly, the primary aim of this work is to use networking segments near faults to share the restoration load throughout a mesh network. Each node searches for restoration paths in their near environment using the proposed DMRA. Nodes use distributed control to search for neighboring nodes and to establish the relationship between them to build numerous logical rings. Nodes can also locate faults in the logical rings. These rings establish the restoration paths. The traffic load over failed links or nodes can be diverted to other paths in the networking segments. The cost of the restoration paths is computed at each node based on both the current capacity and the transmission delay. The selected restoration paths are suitable transmission routes in the network neighborhood. Hence, restoration paths can be identified and wavelength assigned quickly according to network bandwidth and traffic load. Simulation results reveal that the proposed method works extremely quickly and has a high success rate. Consequently, it is very useful for applications in real WDM networks, where the status varies from minute to minute.