WDM loop-back recovery in mesh networks
Authors:
- S.G. FinnSFS.G. Finn
- R.A. BarryRBR.A. Barry
- 1 January 1999
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (0743166X) , 752-759 vol.2
Abstract
Current means of providing loop-back recovery, which is widely used in SONET, relies on fiber-based recovery, where a fiber is used to back up another fiber. We present WDM-based loop-back recovery for optical networks where wavelengths are used to back up other wavelengths. We present two new algorithms for performing WDM-based loop-back over optical mesh networks. The first algorithm performs recovery for link failures. We compare its operation with known ways of providing loop-back recovery and show that the known methods are not applicable to WDM-based recovery. The second algorithm performs WDM loop-back recovery for node failures. We illustrate the operation of both algorithms and prove their validity. We discuss the advantages of WDM-based loop-back for flexibility in WDM service provisioning.Keywords
This publication has 13 references indexed in Scilit:
- Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphsIEEE/ACM Transactions on Networking, 1999
- Survivable network planning methods and tools in TaiwanIEEE Communications Magazine, 1995
- Self-healing algorithm forlogical mesh connection on ring networksElectronics Letters, 1994
- A passive protected self-healing mesh network architecture and applicationsIEEE/ACM Transactions on Networking, 1994
- A novel passive protected SONET bidirectional self-healing ring architectureJournal of Lightwave Technology, 1992
- Dynamics of distributed shortest-path routing algorithms1991
- A multi-period design model for survivable network architecture selection for SONET interoffice networksIEEE Transactions on Reliability, 1991
- Feasibility study of a high-speed SONET self-healing ring architecture in future interoffice networksIEEE Communications Magazine, 1990
- On Algorithms for Enumerating All Circuits of a GraphSIAM Journal on Computing, 1976
- Disjoint paths in a networkNetworks, 1974