1 January 2007 Effective survivable routing algorithm with sharing of spare resources and fast failure recovery in wavelength division multiplexing mesh networks
Author Affiliations +
Optical Engineering, 46(1), 015002 (2007). doi:10.1117/1.2424916
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.
Lei Guo, Lemin Li, "Effective survivable routing algorithm with sharing of spare resources and fast failure recovery in wavelength division multiplexing mesh networks," Optical Engineering 46(1), 015002 (1 January 2007). http://dx.doi.org/10.1117/1.2424916
JOURNAL ARTICLE
7 PAGES


SHARE
KEYWORDS
Failure analysis

Chromium

Wavelength division multiplexing

Lithium

Optical engineering

Optical networks

Broadband telecommunications

Back to Top