An algorithm for link restoration of wavelength routing optical networks

Emmanuel Limal, Kristian Stubkjær

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

527 Downloads (Pure)


We present an algorithm for restoration of single link failure in wavelength routing multihop optical networks. The algorithm is based on an innovative study of networks using graph theory. It has the following original features: it (i) assigns working and spare channels simultaneously, (ii) prevents the search for unacceptable routing paths by pointing out channels required for restoration, (iii) offers a high utilization of the capacity resources and (iv) allows a trivial search for the restoration paths. The algorithm is for link restoration of networks without wavelength translation. Its low complexity is studied in detail and compared to the complexity of a classical path assignment algorithm. Finally, we explain how to use the algorithm to control the restoration path lengths.
Original languageEnglish
Title of host publicationConference Paper on IEEE International Conference on Communications, 1999
Publication date1999
ISBN (Print)0-7803-5284-X
Publication statusPublished - 1999
EventIEEE International Conference on Communications 1999 - Vancouver, Canada
Duration: 6 Jun 199910 Jun 1999


ConferenceIEEE International Conference on Communications 1999
Internet address

Bibliographical note

Copyright: 2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE


Dive into the research topics of 'An algorithm for link restoration of wavelength routing optical networks'. Together they form a unique fingerprint.

Cite this