No abstract

The article deals with a problem that often occurs when calculating stability which one of the main technical characteristics of a communication network with channel switching. The problem is related to the search for backup routes of a given information direction of communication and lies in the fact that for extensive large-scale communication networks, known pathfinding algorithms that are usually used to solve this problem become ineffective. Various algorithms are proposed that will allow finding all the 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, in view of finding the maximum set of independent simple paths, can find application in solving a range of routing problems.