TY - GEN
T1 - Restoration from multiple faults in WDM networks without wavelength conversion
AU - Sue, Chuan Ching
AU - Kuo, Sy Yen
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.
PY - 2001
Y1 - 2001
N2 - This paper addresses the problem of achieving full and fast restoration to tolerate as many faults as possible in wavelength-routed wavelength division multiplexing (WDM) networks with no wavelength conversion. We model the problem of finding the maximum number of faults tolerated as a constrained ring cover problem, which is a decomposition problem of exponential complexity. Three heuristic methods which guarantee that at least one fault can be tolerated are proposed. The Ear Decomposition (ED) method can always generate a decomposition to guarantee that only one fault can be tolerated. The Planar Decomposition (PD) method, which takes advantage of the bipartite graph model to generate a decomposition, can tolerate up to f faults, where f is the maximum cardinality between the two bipartite vertex sets. The Maximally Separated Rings (MSR) method uses the greedy method to find a decomposition to tolerate as many faults as possible. The marked-link (ML) method is also proposed to enhance the performance by marking some links, which are originally used for protection, available for normal transmissions. Finally, we also evaluate the number of faults tolerated and the blocking probabilities of these methods in three example networks.
AB - This paper addresses the problem of achieving full and fast restoration to tolerate as many faults as possible in wavelength-routed wavelength division multiplexing (WDM) networks with no wavelength conversion. We model the problem of finding the maximum number of faults tolerated as a constrained ring cover problem, which is a decomposition problem of exponential complexity. Three heuristic methods which guarantee that at least one fault can be tolerated are proposed. The Ear Decomposition (ED) method can always generate a decomposition to guarantee that only one fault can be tolerated. The Planar Decomposition (PD) method, which takes advantage of the bipartite graph model to generate a decomposition, can tolerate up to f faults, where f is the maximum cardinality between the two bipartite vertex sets. The Maximally Separated Rings (MSR) method uses the greedy method to find a decomposition to tolerate as many faults as possible. The marked-link (ML) method is also proposed to enhance the performance by marking some links, which are originally used for protection, available for normal transmissions. Finally, we also evaluate the number of faults tolerated and the blocking probabilities of these methods in three example networks.
UR - http://www.scopus.com/inward/record.url?scp=77951524520&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77951524520&partnerID=8YFLogxK
U2 - 10.1007/3-540-47728-4_31
DO - 10.1007/3-540-47728-4_31
M3 - Conference contribution
AN - SCOPUS:77951524520
SN - 3540423028
SN - 9783540423027
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 317
EP - 325
BT - Networking - ICN 2001 - 1st International Conference on Networking, Proceedings
A2 - Lorenz, Pascal
PB - Springer Verlag
T2 - 1st International Conference on Networking, ICN 2001
Y2 - 9 July 2001 through 13 July 2001
ER -