A new and improved algorithm for dynamic survivable routing in optical WDM networks
Computer Communications
Multicast protection scheme in survivable WDM optical networks
Journal of Network and Computer Applications
A new heuristic routing algorithm with Hamiltonian Cycle Protection in survivable networks
Computer Communications
New insights on survivability in multi-domain optical networks
Information Sciences: an International Journal
A Novel Fault Diagnosis Approach to Path-Protected WDM Mesh Networks
APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
A survey of survivability in multi-domain optical networks
Computer Communications
Cost Efficient Fault Tolerant Design in Mesh Optical Networks with the Load Aware Method
Journal of Network and Systems Management
An efficient critical protection scheme for intra-domain routing using link characteristics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Capacity planning providing 100 % survivability against double-link failures for WDM Networks
Photonic Network Communications
Computing blocking probabilities in survivable WDM optical networks
Photonic Network Communications
Hi-index | 0.25 |
This article introduces the design principles and state-of-the-art progress in developing survivable routing schemes for shared protection in mesh WDM networks. This article first gives an overview of the diverse routing problem for both types of protection in mesh networks, path-base and segment shared protection; then the cost function and link state for performing diverse routing are defined by which the maximum extent of resource sharing can be explored in the complete routing information scenario. Review is conducted on the most recently reported survivable routing schemes along with state-of-the-art progress in diverse routing algorithms for segment shared protection. The following three reported algorithms are discussed in detail: iterative two-step-approach, potential backup cost, and maximum likelihood relaxation.