An algorithm for link restoration of wavelength routing optical networks

Emmanuel Limal; Kristian Stubkjær

doi:10.1109/ICC.1999.765620

An algorithm for link restoration of wavelength routing optical networks

Emmanuel Limal
, Kristian Stubkjær

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

794 Downloads (Orbit)

Abstract

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 language	English
Title of host publication	Conference Paper on IEEE International Conference on Communications, 1999
Volume	3
Publication date	1999
Pages	2055-2061
ISBN (Print)	0-7803-5284-X
DOIs	https://doi.org/10.1109/ICC.1999.765620
Publication status	Published - 1999
Event	IEEE International Conference on Communications 1999 - Vancouver, Canada Duration: 6 Jun 1999 → 10 Jun 1999 http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6202

Conference

Conference	IEEE International Conference on Communications 1999
Country/Territory	Canada
City	Vancouver
Period	06/06/1999 → 10/06/1999
Internet address	http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6202

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

Access to Document

10.1109/ICC.1999.765620

LimalFinal published version, 620 KB

OpenUrl availability

Check availability in DTU Findit

Cite this

@inproceedings{1d395fcbba904987a5318979a8cb3fba,

title = "An algorithm for link restoration of wavelength routing optical networks",

abstract = "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.",

author = "Emmanuel Limal and Kristian Stubkj{\ae}r",

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; IEEE International Conference on Communications 1999, ICC '99 ; Conference date: 06-06-1999 Through 10-06-1999",

year = "1999",

doi = "10.1109/ICC.1999.765620",

language = "English",

isbn = "0-7803-5284-X",

volume = "3",

pages = "2055--2061",

booktitle = "Conference Paper on IEEE International Conference on Communications, 1999",

url = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6202",

}

TY - GEN

T1 - An algorithm for link restoration of wavelength routing optical networks

AU - Limal, Emmanuel

AU - Stubkjær, Kristian

N1 - 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

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

U2 - 10.1109/ICC.1999.765620

DO - 10.1109/ICC.1999.765620

M3 - Article in proceedings

SN - 0-7803-5284-X

VL - 3

SP - 2055

EP - 2061

BT - Conference Paper on IEEE International Conference on Communications, 1999

T2 - IEEE International Conference on Communications 1999

Y2 - 6 June 1999 through 10 June 1999

ER -

An algorithm for link restoration of wavelength routing optical networks

Abstract

Conference

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this