Title :
Restoration with wavelength conversion in WDM networks
Author :
Luo, Y. ; Ansari, N.
Author_Institution :
Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA
fDate :
8/1/2002 12:00:00 AM
Abstract :
The integer linear programming formulas are derived and the relaxed heuristic algorithm is proposed to restore paths in WDM networks with wavelength converters. Compared with the disjoint path protection and the shared path protection methods, the proposed heuristic algorithm has much better performance in terms of recovery cost, additive latency, and restoration coverage
Keywords :
directed graphs; integer programming; linear programming; optical wavelength conversion; telecommunication network routing; wavelength division multiplexing; WDM networks; additive latency; directed graph; integer linear programming formulas; network survivability; on-line restoration; paths restoration; recovery cost; relaxed heuristic algorithm; resource efficiency; restoration coverage; routing and wavelength assignment; sharing spare capacity; single link faults; suboptimum solution; wavelength converters;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:20020615
