About the Set of Independent Paths in the Graph

被引：0
|
作者：
Starikov, P. P. [1 ]
Terentyeva, Yu Yu [1 ]
机构：
[1] Fed State Autonomous Sci Inst Ctr Informat Techno, 19 Presnensky Val, Moscow 123557, Russia
来源：
CYBERNETICS PERSPECTIVES IN SYSTEMS, VOL 3 | 2022年 / 503卷
关键词：
Communication network; Graph algorithms; Pathfinding; Heuristic algorithms;
D O I：
10.1007/978-3-031-09073-8_34
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：401 / 409
页数：9
相关论文
共 50 条
12345