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

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.