Allocation of Protection Domains in Dynamic WDM Mesh Networks

Authors:
Pin-Han Ho;H. T. Mouftah
Affiliations:
-;-
Venue:
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Year:
2002

Citing 0
Cited 3

Reconfiguration of spare capacity for MPLS-based recovery in the internet backbone networks

IEEE/ACM Transactions on Networking (TON)
Virtual Private/Overlay Network Design With Traffic Concentration and Shared Protection

Journal of Network and Systems Management
A heuristic algorithm for shared segment protection in mesh WDM networks with limited backup path/segments length

Computer Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we solve the survivable routing problem in dynamic WDM mesh networks under the framework of Short Leap Shared Protection (SLSP). A novel algorithm called Cascaded Diverse Routing (CDR) is proposed. We also demonstrate a novel approach to solving the diverse routing problem in networks with dynamic traffic for the purpose of shared protection, called Iterative Two-Step-Approach (ITSA). Simulation is conducted using four different networks (22-, 30-, 79-, 100-node) for a comparison between ordinary shared protection schemes and the SLSP scheme. Simulation results show that the best performance can be achieved with well-designed diameter of protection domains for every connection request according to the size and topology of the network.