New and improved approaches for shared-path protection in WDM mesh networks

This paper investigates the problem of dynamic survivable lightpath provisioning in optical mesh networks employing wavelength-division multiplexing (WDM). In particular, we focus on shared-path protection because it is resource efficient due to the fact that backup paths can share wavelength links...

Full description

Saved in:
Bibliographic Details
Published in:Journal of lightwave technology 2004-05, Vol.22 (5), p.1223-1232
Main Authors: Canhui Ou, Jing Zhang, Hui Zang, Sahasrabuddhe, L.H., Mukherjee, B.
Format: Article
Language:English
Subjects:
Applied sciences
Backups
Computer networks
Dynamic tests
Exact sciences and technology
Heuristic
Intelligent networks
Mathematical models
Mesh networks
Multiprotocol label switching
Networks
Operation, maintenance, reliability
Optical fiber networks
Protection
Provisioning
Resource management
Routing
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Wave division multiplexing
Wavelength division multiplexing
WDM networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper investigates the problem of dynamic survivable lightpath provisioning in optical mesh networks employing wavelength-division multiplexing (WDM). In particular, we focus on shared-path protection because it is resource efficient due to the fact that backup paths can share wavelength links when their corresponding working paths are mutually diverse. Our main contributions are as follows. 1) First, we prove that the problem of finding an eligible pair of working and backup paths for a new lightpath request requiring shared-path protection under the current network state is NP-complete. 2) Then, we develop a heuristic, called CAFES, to compute a feasible solution with high probability. 3) Finally, we design another heuristic, called OPT, to optimize resource consumption for a given solution. The merits of our approaches are that they capture the essence of shared-path protection and approach to optimal solutions without enumerating paths. We evaluate the effectiveness of our heuristics and the results are found to be promising.
ISSN:0733-8724
1558-2213
DOI:10.1109/JLT.2004.825346