MSDP with ACO: A maximal SRLG disjoint routing algorithm based on ant colony optimization

Failure resilience is a desired feature in communication networks, and different methods can be considered in order to achieve this feature. One of these methods is diverse Routing. In this paper, we are going to suggest a sort of diverse routing algorithm, which can find two maximal shared risk link group (SRLG) disjoint paths between a source and a destination node. This algorithm is based on ant colony optimization algorithm, which consists of three parts. These parts are graph transformation technique, finding two maximal edge-disjoint routes and reverse transformation. The final routes are always maximal SRLG disjoint. Simulation results show the efficiency of the proposed method.