Title :
ILP based diverse path routing with node inclusion
Author :
Lakatos, Zs ; Bajzik, L. ; Karasz, T. ; Berczi, K. ; Kovacs, E. ; Vegh, L.
Author_Institution :
Nokia Siemens Networks, Budapest, Hungary
Abstract :
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.
Keywords :
integer programming; linear programming; telecommunication network routing; ILP; cluster interconnection; clustered network; diverse path routing; hierarchical traffic grooming; integer linear programming; maximally disjoint solution; node inclusion; Force; IP networks; Multiprotocol label switching; Network topology; Optical fiber networks; Routing; Topology; ILP based routing; diverse path routing with node inclusion; hierarchical grooming; multi-domain networks;
Conference_Titel :
Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), 2011 3rd International Congress on
Conference_Location :
Budapest
Print_ISBN :
978-1-4577-0682-0
