In this paper, we focus on the survivable traffic grooming problem under SRLG (Shared Risk Link Groups)
constraints in WDM mesh networks. Our objective is to minimize the total network resource for a given traffic
demands metric. An efficient simplified ILP (Integer Linear Programming) mathematical formulation is presented.
Considering the computational complexity of ILP, a fast heuristic algorithm named Cross Layer Information
Routing & Multi-Layer Traffic Grooming (CLIR-MLTG) is proposed and evaluated. We compare our simplified
ILP model with the regular ILP model, and the CLIR-MLTG algorithm is also compared both with our simplified
model and a heuristic algorithm named SSR in the literature . Finally, we demonstrate in numerical results that our
simplified ILP model obtains optimal performance and costs much less time compared to the regular ILP model, and
the CLIR-MLTG algorithm outperforms the SSR scheme and it obtains similar performance compared to the ILP
In this paper, we propose a heuristic algorithm for solving node inclusion routing problem with additive constraints for the first time. The node inclusion routing problem is significant while a demand need to by-pass several domains and some boundary routers are assigned to be appeared in the route. The integer linear programming model is presented. Two other heuristic algorithms are evaluated. The results show that our heuristic algorithm is more effective with lower trap ratio and very close to the optimal result.