Copyright © 2006 Elsevier B.V. All rights reserved.
Recovery time guaranteed heuristic routing for improving computation complexity in survivable WDM networks
Received 20 October 2006;
revised 5 December 2006;
accepted 14 December 2006.
Available online 22 December 2006.
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.
Keywords: Optical networks; Protection; Segment-backup path; Recovery time; Time complexity






E-mail Article
Add to my Quick Links

Cited By in Scopus (2)

1. Another is based on the exponential function of energy utilization at nodes, and the competitive ratio of this latter algorithm is also analyzed if admission control mechanism is employed. We then conduct extensive experiments by simulations to analyze the performance of the proposed algorithms, in terms of network capacity, network lifetime, and the transmission energy consumption for each disjoint path connection request. The experimental results show that the proposed algorithms outperform those existing algorithms that do not take into account the power load balancing at nodes in terms of maximizing the network capacity.





