About the Set of Independent Paths in the Graph

The paper considers a problem, which is often encountered in the calculation of stability, one of the main technical characteristics of a link-switched communication network. The problem is related to the search for redundant routes of a given information communication direction and consists in the fact that for branched large-scale communication networks, the known path search algorithms, which are usually used to solve this problem, become ineffective. Various algorithms are proposed to find all available independent simple paths between the given vertices of the graph, thereby providing a more accurate estimate of stability and throughput. In addition, the solution of this problem due to finding the maximum set of independent simple paths can find application in solving a range of routing problems.