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