Efficient algorithms for routing dependable connections in WDM optical networks
IEEE/ACM Transactions on Networking (TON)
Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
A dynamic partitioning sub-path protection routing technique in WDM mesh networks
ICCC '02 Proceedings of the 15th international conference on Computer communication
Partial Path Protection for WDM Networks: End-to-End Recovery Using Local Failure Information
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
On Improving Partial Information Routing With Segmented Path Protection
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
A framework for service-guaranteed shared protection in WDM mesh networks
IEEE Communications Magazine
An overview of constraint-based path selection algorithms for QoS routing
IEEE Communications Magazine
Survivable lightpath routing: a new approach to the design of WDM-based networks
IEEE Journal on Selected Areas in Communications
Optimal segment size for fixed-sized segment protection in wavelength-routed optical networks
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
Availability formulations for segment protection
IEEE Transactions on Communications
Hi-index | 0.00 |
This paper investigates the problem of dynamic survivable lightpath provisioning against single-node/link failures in optical mesh networks employing wavelength-division multiplexing (WDM). We unify various forms of segment protection into generalized segment protection (GSP). In GSP, the working path of a lightpath is divided into multiple overlapping working segments, each of which is protected by a node-/link-disjoint backup segment. We design an efficient heuristic which, upon the arrival of a lightpath request, dynamically divides a judiciously selected working path into multiple overlapping working segments and computes a backup segment for each working segment while accommodating backup sharing. Compared to the widely considered shared-path protection scheme, GSP achieves much lower blocking probability and shorter protection-switching time for a small sacrifice in control and management overhead. On the basis of generalized segment protection, we present a new approach to provisioning lightpath requests according to their differentiated quality-of-protection (QoP) requirements. We focus on one of the most important QoP parameters-namely, protection-switching time-since lightpath requests may have differentiated protection-switching-time requirements. For example, lightpaths carrying voice traffic may require 50 ms protection-switching time while lightpaths carrying data traffic may have a wide range of protection-switching-time requirements. Numerical results show that our approach achieves significant performance gain which leads to a remarkable reduction in blocking probability. While our focus is on the optical WDM network, the basic ideas of our approaches can be applied to multi-protocol label switching (MPLS) networks with appropriate adjustments, e.g., differentiated bandwidth granularities.