DocumentCode
3142060
Title
A Heuristic Detection/Protection Algorithm on DWDM Layers
Author
He, Donna Dong ; Yang, Oliver
Author_Institution
CCNR Lab, Ottawa Univ., Ont.
fYear
2006
fDate
38838
Firstpage
859
Lastpage
862
Abstract
In this paper we propose a heuristics for the failure detection/protection in optical networks. We shall utilize the algorithms of Eulerian graph, the minimum perfect matching algorithm and the Dijstra shortest-path algorithms. Our performance evaluation and comparison shows that our algorithm is the simplest among all heuristic algorithms to provide a cycle cover for both detection and full-protection
Keywords
graph theory; minimisation; optical fibre networks; wavelength division multiplexing; DWDM layers; Dijstra shortest-path algorithm; Eulerian graph; heuristic detection algorithm; heuristic protection algorithm; minimum perfect matching algorithm; optical network; performance evaluation; wavelength division multiplexing; Condition monitoring; Fault detection; Helium; Heuristic algorithms; Information technology; Mesh networks; Optical fiber networks; Protection; Telecommunication network topology; Wavelength division multiplexing; Cycle cover; Eulerian graph; Network protection;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Computer Engineering, 2006. CCECE '06. Canadian Conference on
Conference_Location
Ottawa, Ont.
Print_ISBN
1-4244-0038-4
Electronic_ISBN
1-4244-0038-4
Type
conf
DOI
10.1109/CCECE.2006.277612
Filename
4054947
Link To Document