Finding protection cycles in DWDM networks

IEEE International Conference on Communications

Volumn 5, Issue , 2002, Pages 2756-2760

  Zhang, Hanxi ^a   Yang, Oliver ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SIMULATION; FIBER OPTIC NETWORKS; NETWORK PROTOCOLS; TOPOLOGY;

SPARSE MESH NETWORKS;

DENSE WAVELENGTH DIVISION MULTIPLEXING;

EID: 0036283284     PISSN: 05361486     EISSN: None     Source Type: Journal    
DOI: 10.1109/ICC.2002.997344     Document Type: Article

References (19)

1. A class of self-healing ring architectures for SONET network applications
2. Survivable SONET network design
3. Current approaches in the design of ring-based optical networks
4. Comparison of mathematical programming approaches to optical ring networks
5. On algorithms for enumerating all circuits of a graph
6. Finding all the elementary circuits of a directed graph
7. Sub graph identification - Segs, circuits and paths
8. Non-deterministic algorithms
9. An algorithm for designing rings for survivable fiber networks
10. Techniques for finding ring covers in survivable networks
11. Theoretical underpinnings for the efficiency of restorable networks using pre-configured cycle
12. Cycle-oriented distributed pre-configuration: Ring-like speed with mesh-like capacity for self-planning network restoration
13. A novel approach to automatic protection switching using trees
14. Light-trees: Optical multicasting for improved performance in wavelength-routed networks