On the Challenges of Finding Two Linkdisjoint Lightpaths of Minimum Total Weight Across an Optical Network

Free registration required

Executive Summary

The problem of finding two link-disjoint (primary and backup) paths of minimum total weight across a network is referred to as Problem 2DP. For this problem, there exist computationally efficient solving algorithms such as the one developed by Suurballe and Tarjan. Indeed, the latter has become the reference algorithm for solving Problem 2DP in the context of IP networks. In this paper, the authors analyze the challenges of developing an algorithm inspired in Suurballe and Tarjan for solving Problem 2DP in the context of wavelength switched optical networks. They examine the challenges under the wavelength continuity constraint as well as in the cases of partial and full wavelength conversion.

  • Format: PDF
  • Size: 1151.9 KB