Survivable and traffic-oblivious routing in WDM networks: valiant load balancing versus tree routing

Abstract

This paper investigates the issue of survivable routing to prevent arbitrary single-link failures in WDM networks when the traffic information is partially known. Two novel protection schemes called valiant-load-balancing- (VLB-) based hop constraint segment protection (VLB-HCSP) and hop constraint minimizing leaf nodes (HCMLN) are proposed and evaluated. Simulation results confirm our expectation that VLB-HCSP can achieve a desirable compromise between cost and failure recovery time compared with the previous VLB-based method, while HCMLN performs even more inspiringly for being able to provide both a low-cost budget and a fast recovery at the same time, in contrast to VLB-HCSP and the other existing schemes.