ILP based diverse path routing with node inclusion

In this paper, we propose an ILP (Integer Linear Programming) based solution for Diverse Path Routing with Node Inclusion (DPRNI). First, DPRNI is introduced as a relevant routing problem in hierarchical traffic grooming of clustered networks where the interconnection between clusters is allowed via predefined hubs only. Then an ILP based solution is proposed, which guarantees the cost optimality of the calculated paths, avoids trap scenarios and computes the maximally-disjoint solution (node, edge and SRLG). The results are generated by ILP using an open source solver and compared to brute force method. The scalability and sensibility of the proposed solution is also examined.