A Novel Dynamic Fault Restoration Mechanism Using a Multiple Ring Approach in WDM Mesh Networks
- 48 Downloads
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.
Keywordsfault restoration DMRA WDM multiple logical rings networking segment
Unable to display preview. Download preview PDF.
- 5.Maier, G., Pattavina, A., Patre, S. D., Martinelli, M. 2002Optical network survivability: protection techniques in the WDM layerPhotonic Network Communications4251269Google Scholar
- 6.F. Chang, A. Godin, D. Katsuda, J. Weil, Understanding values of mesh networking in the metro, Optical Planning Supporting Documentation, http://www.nortelnetworks.com/ corporate/programs/opt_planning/index.html
- 7.O. J. Wasem, An algorithm for designing rings for survivable fiber networks, IEEE Transactions on Reliability, vol. 40, no. 4, (October 1991), pp. 57.5.1–57.5.7Google Scholar
- 9.Jaeger, F. 1985A survey of the double cycle cover conjecture, Cycles in graphsAnnals of Discrete MathematicsAmsterdam, The Netherlands: North-Holland112Google Scholar
- 10.W.D. Grover, D. Stamatelakis, Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network reconfiguration, Proc. of IEEE ICC ’98, (Atlanta, USA, June 1998), vol. 1, pp. 537–543Google Scholar
- 17.P. Gadiraju, H.T. Mouftah, Channel protection in WDM mesh networks, 2001 IEEE Workshop on High Performance Switching and Routing, (Dallas, USA, May 2001), pp. 26–30Google Scholar
- 18.Assi, C. M., Shami, A. A., Ali, M. A., Zhang, Z., Liu, X. 2002Impact of wavelength converters on the performance of optical networksOptical Networks Magazine32230Google Scholar
- 19.S. Arakawa, M. Murata, Lightpath management of logical topology with incremental traffic changes for reliable IP over WDM networks, Optical Networks Magazine, (May/June 2002), pp. 68–76Google Scholar