OSA's Digital Library

Optics Express

Optics Express

  • Editor: Michael Duncan
  • Vol. 14, Iss. 23 — Nov. 13, 2006
  • pp: 10990–10995

A new heuristic algorithm with shared segment-backup paths for trap avoidance in survivable optical networks

Lei Guo, Lemin Li, Jin Cao, and Hongfang Yu  »View Author Affiliations

Optics Express, Vol. 14, Issue 23, pp. 10990-10995 (2006)

View Full Text Article

Enhanced HTML    Acrobat PDF (105 KB)

Browse Journals / Lookup Meetings

Browse by Journal and Year


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools



This paper proposes a new heuristic algorithm, called Quick Method with Shared Protection (QMSP), to protect the single-link failure in survivable WDM optical networks. QMSP first computes one primary path for each connection request. If the primary path is a trap path, QMSP will compute two segment-backup paths to avoid the trap problem based on the routing policy. Compared to previous algorithms, QMSP not only has better time complexity but also can obtain higher resource utilization ratio and lower blocking probability.

© 2006 Optical Society of America

OCIS Codes
(060.4250) Fiber optics and optical communications : Networks
(060.4510) Fiber optics and optical communications : Optical communications

ToC Category:
Fiber Optics and Optical Communications

Original Manuscript: September 26, 2006
Revised Manuscript: October 20, 2006
Manuscript Accepted: October 25, 2006
Published: November 13, 2006

Lei Guo, Lemin Li, Jin Cao, and Hongfang Yu, "A new heuristic algorithm with shared segment-backup paths for trap avoidance in survivable optical networks," Opt. Express 14, 10990-10995 (2006)

Sort:  Author  |  Year  |  Journal  |  Reset  


  1. S. Ramamurthy, L. Sahasrabuddhe, B. Mukherjee, "Survivable WDM mesh networks," J. Lightwave. Technol. 21, 870-883 (2003). [CrossRef]
  2. R. He, H. Wen, L. Li, G. Wang, "Shared sub-path protection algorithm in traffic-grooming WDM mesh networks," Photonic Netw. Commun. 8, 239-249 (2004). [CrossRef]
  3. H. Wen, L. Li, R. He, H. Yu, S. Wang, N. Song, "Dynamic grooming algorithms for survivable WDM mesh networks," Photonic Netw. Commun. 7, 253-263 (2003). [CrossRef]
  4. Y. Wang, Q. Zeng, H. Zhao, "Dynamic survivability in WDM mesh networks under dynamic traffic," Photonic Netw. Commun. 6, 5-24 (2003). [CrossRef]
  5. C. Ou, J. Zhang, H. Zang, L. Sahasrabuddhe, B. Mukherjee, "New and improved approaches for shared-path protection in WDM mesh networks," J. Lightwave. Technol. 22, 1223-1232 (2004). [CrossRef]
  6. J. Suurballe, R. Tarjan, "A quick method for finding shortest pairs of disjoint paths," Networks,  14, 325-326 (1984). [CrossRef]
  7. H. Wen, S. Wang, L. Li, "A routing algorithm for finding low-cost pair of no shared-risk paths," J. Electron. Info. Technol. 25, 824-830 (2003).
  8. M. Barbehenn, "A note on the complexity of Dijkstra’s algorithm for graphs with weighted vertices," IEEE Trans. Comp. 47, 263 (1998). [CrossRef]

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited