An effective evolutionary computational approach for routing optimization in networks with shared risk link groups

Abstract

In this work, we study a routing optimization problem in networks with shared risk link groups (SRLGs). Specifically, a path between a source and a destination is determined such that the combined path cost and the weight of SRLGs to which the links of the path belong is minimized. We develop evolutionary computation based algorithms to solve the problem. The performance of the proposed algorithms is evaluated via extensive simulation and is compared with the solutions obtained by integer linear programming and the heuristic algorithm in [1]. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.