Evaluating tradeoff between PDP and k-FDP algorithms under sharing reliable links

This paper evaluates tradeoff between the partial disjoint path (PDP) and the k failure-disjoint path (k-FDP) algorithms for finding k disjoint paths that share reliable links, which have no failures. Adopting a suitable algorithm for each network scenario is able to save time for network operators or save cost for network providers. We provide examined data under sharing reliable links scenario for implementing survivability of networks. The PDP algorithm finds k disjoint paths with sharing reliable links. The FDP algorithm finds disjoint paths with minimum summation of two disjoint path costs. The k-FDP algorithm is extended from the original FDP algorithm. However, k-FDP takes longer time to find the disjoint paths than PDP for same cases. In this paper, computational time and summation of path costs are considered as performance indicators. The performance of both algorithms is examined using computer simulations with various network topologies. The simulation results show that the k-FDP algorithm takes a large amount of computational time to find k disjoint paths when the number of nodes increases. The PDP algorithm is able to reduce the computational time to find k disjoint paths in the networks by 99% compared to the k-FDP algorithm. However, the summation of path costs of PDP is higher when the number of required disjoint paths increases. Our comparative results assist network operators or planners to understand the tradeoff between PDP and k-FDP which in turn helps them to make an appropriate decision in network implementations.