Share Email Print

Optical Engineering

Effective survivable routing algorithm with sharing of spare resources and fast failure recovery in wavelength division multiplexing mesh networks
Author(s): Lei Guo; Lemin Li
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper investigates the dynamic survivable routing problem and proposes an effective path-based protection algorithm, called the dynamic joint routing approach (DJRA), to completely protect against double-link failures in meshed wavelength division multiplexing optical networks. In DJRA, each connection is assigned a primary path and two link-disjoint backup paths to tolerate the simultaneous failures of two arbitrary fiber links. In order to improve the algorithm performance, we consider three key issues: (1) sharing spare backup resources, (2) failure recovery time, and (3) trap-path avoidance. Therefore, compared to previous algorithms, DJRA obtains better performance and is also able to yield flexible trade-off solutions.

Paper Details

Date Published: 1 January 2007
PDF: 7 pages
Opt. Eng. 46(1) 015002 doi: 10.1117/1.2424916
Published in: Optical Engineering Volume 46, Issue 1
Show Author Affiliations
Lei Guo, Northeastern Univ. (China)
Lemin Li, Univ. of Electronic Science and Technology of China (China)

© SPIE. Terms of Use
Back to Top