Recovery time guaranteed heuristic routing for improving computation complexity in survivable WDM networks

  • Authors:
  • Lei Guo

  • Affiliations:
  • College of Information Science and Engineering, Northeastern University, Shenyang 110004, China and Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electr ...

  • Venue:
  • Computer Communications
  • Year:
  • 2007

Quantified Score

Hi-index 0.24

Visualization

Abstract

In this paper, we investigate the protection for survivable WDM optical network and propose a new algorithm called Quick Heuristic Routing (QHR) to tolerate the single-link failure. In QHR, each connection request will be assigned to one primary path and multiple segment-backup paths to guarantee the recovery time in the worst case. Compared to previous algorithm, QHR can yield significant improvements in computation time and blocking probability. Simulations are shown to be promising.