Node-disjoint paths search in WDM networks with asymmetric nodes

Provisioning of a pair of disjoint paths is very important in WDM network planning and management to provide fault tolerant services. However, known node-disjoint paths search methods do not efficiently work in networks with asymmetric nodes which have restrictions on the internal connection between outer links. In this paper, we present a novel node-disjoint paths search method for networks with asymmetric nodes. The proposed approach handles the internal connections properly. In simulation results, the proposed approach efficiently solves the problems. In addition, the proposed method can result in valid disjoint paths with low computation cost.