ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Communications
Volume 30, Issue 6, 26 March 2007, Pages 1331-1336
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (170 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comcom.2006.12.014    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2006 Elsevier B.V. All rights reserved.

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

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Lei GuoCorresponding Author Contact Information, a, b, E-mail The Corresponding Author

aCollege of Information Science and Engineering, Northeastern University, Shenyang 110004, China

bKey Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Chengdu 610054, China


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

Article Outline

1. Introduction
2. Problem statement
2.1. Network model
2.2. Recovery time
2.3. Routing selection in SSP
2.4. Routing selection in QHR
3. Proposed heuristic algorithm
3.1. Process of QHR
3.2. Comparison of QHR and SSP
4. Simulation results and analysis
5. Conclusion
Acknowledgements
References
Vitae






Corresponding Author Contact InformationTel.: +86 28 53601343.

Computer Communications
Volume 30, Issue 6, 26 March 2007, Pages 1331-1336
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.