Restoration from multiple faults in WDM networks without wavelength conversion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2093, Issue , 2001, Pages 317-325

  Sue, Chuan Ching ^a   Kuo, Sy Yen ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCKING PROBABILITY; COMPLEX NETWORKS; GRAPH THEORY; RESTORATION; WAVELENGTH DIVISION MULTIPLEXING;

BIPARTITE GRAPHS; DECOMPOSITION PROBLEMS; EAR DECOMPOSITION; EXPONENTIAL COMPLEXITY; FAST RESTORATION; MULTIPLE FAULTS; WAVELENGTH DIVISION MULTIPLEXING NETWORKS; WAVELENGTH ROUTED;

HEURISTIC METHODS;

EID: 77951524520     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47728-4_31     Document Type: Conference Paper

References (11)

1. M. Medard, S. G. Finn, and R. A. Barry, “WDM Loop-back Recovery in Mesh Networks,” Proc. Infocom '99, pp. 752-759, Mar 1999.
2. S. Ramamurthy and B. Mukherjee, “Survivable WDM Mesh Networks, Part I - Protection,” Proc. Infocom '99, pp. 744-751, Mar 1999.
3. Y. Miyao and H. Saito, “Optimal Design and Evaluation of Survivable WDM Transport Networks,” IEEE J. Select. Areas Commun., vol. 16, no. 7, pp. 1190-1198, Sep, 1998.
4. O. Gerstel, et al., “Fault Tolerant Multiwavelength Optical Rings with Limited Wavelength Conversion,” IEEE J. Select. Areas Commun., vol. 16, no. 7, pp. 1166-1178, Sep, 1998.
5. S. Baroni, et al., “Link failure restoration in WDM Optical Transport Networks and The Effect of Wavelength Conversion,” Proc. Int'l Conf. Optical Fiber Communication, pp. 123-124, Feb 1997.
6. R. Barry and P. Humblet, “Models of Blocking Probability in All-Optical Networks with and Without Wavelength Changers,” IEEE J. Select. Areas Commun., vol. 14, no. 5, pp. 858-866, June 1996.
7. G. Ellinas and T. Stern, “Automatic Protection Switching for Link Failures in Optical Networks with Bi-directional Links,” Proc. IEEE Int'l Conf. Globecom, pp. 152-156, Nov, 1996.
8. S. Even, “Graph Algorithms,” Computer Science Press, 1979.
9. C. Li and R. Ramaswami, “Automatic Fault Detection, Isolation, and Recovery in Transparent All-Optical Networks,” IEEE J. Lightwave Technol., vol. 15, no. 10, pp. 1784-1793, Oct, 1997.
10. S. G. Finn, M. Medard, R. A. Barry, “A New algorithm for bi-directional link self-healing for arbitrary redundant networks,” Proc. Int'l Conf. Optical Fiber Communication, pp. 298-299, Feb 1998.
11. Yannakakis, M., “The effect of a connectivity requirement on the complexity of maximum subgraph problems,” J. ACM, pp. 618-630, May 1979.