Impairment aware optimal diverse routing for survivable optical networks

In wavelength-routed optical networks, a lightpath connection can be provisioned only if a path, or a pair of paths in case of path protection is required, can be found which satisfies multiple constraints while simultaneously achieving optimal primary cost. The primary cost can be any metric set by network administrators, and the constraints concerned in optical networks include wavelength continuity constraint, accumulation effect of some transmission impairments in the optical domain, and SRLG-disjoint requirement in survivable networks. In this paper, the impact of these constraints on the optimal path calculation algorithms is studied. Three novel algorithms for solving this problem, which we call “Impairment Aware Optimal Path Pair” problem, are proposed, and their performance is evaluated through extensive simulations.