Tracking long-term growth of the NSFNET
Communications of the ACM
All-optical networks with sparse wavelength conversion
IEEE/ACM Transactions on Networking (TON)
Some principles for designing a wide-area WDM optical network
IEEE/ACM Transactions on Networking (TON)
Optical networks: a practical perspective
Optical networks: a practical perspective
Efficient algorithms for routing dependable connections in WDM optical networks
IEEE/ACM Transactions on Networking (TON)
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Fiber Network Service Survivability
Fiber Network Service Survivability
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Robust Routing in Wide-Area WDM Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
IEEE/ACM Transactions on Networking (TON)
Issues for routing in the optical layer
IEEE Communications Magazine
Models of blocking probability in all-optical networks with and without wavelength changers
IEEE Journal on Selected Areas in Communications
A highly efficient path-restoration protocol for management of optical network transport integrity
IEEE Journal on Selected Areas in Communications
Computers and Operations Research
| Hi-index | 0.00 |
Path protection requires finding a working path and a protection path that are link disjoint. In this paper, we consider two fundamental problems on dynamic lightpath protection in WDM mesh networks. In the first problem, we consider a network without wavelength converters; thus both the working lightpath and protection lightpath are subject to the wavelength continuity constraint. Existing polynomial time algorithms can be applied to find a pair of link-disjoint lightpaths on a single wavelength; however, such algorithms fail if the working and protection lightpaths are on two different wavelengths. In the second problem, we consider a network with full wavelength conversion; thus the wavelength continuity constraint does not apply. Yet a single factor can cause multiple fiber links to fail simultaneously. The problem becomes finding link-disjoint lightpaths that are also risk disjoint. We prove that both of the two problems are NP-complete. We develop ILP formulations and heuristic algorithms for the two NP-complete problems. Practical constraints such as service level agreement (SLA) and priority are also considered. Computer simulations are conducted to evaluate the performance of the heuristic algorithms.