Формирование резервных путей на основе алгоритма дейкстры в целях повышения устойчивости информационно-телекоммуникационных сетей

Abstract

Purpose: The analysis of studies in the area of routing stability shows that the main direction of modification of the shortest path seeking algorithms is enhancement of presentation and formats of initial data due to accounting line metrics factors which define various characteristics of a real network. The goal of the paper is to enhance stability of connection by modification of Dijkstra algorithm to increase its productivity searching both the shortest and reserve paths to elements of a network. Methods: In order to use topological redundancy of the network Dijkstra algorithm has been modified towards expansion of its functionality by seeking both the shortest and reserve paths. This expansion is provided by introducing additional sets and blocks in the field of the algorithm. Results: There has been developed modified Dijkstra algorithm which modification is based on application of incoming line edges for seeking reserve paths to the elements. A growth of connection network stability is evaluated according to an index of stability probability of an information direction. There has been considered the algorithm operation on the example of a network, it has been shown that its application increases stability from 5 up to 35 % based on the given index. Practical implications: The proposed modification of Dijkstra algorithm can be used to enhance OSPF and PNNI protocols efficiency at routing informational streams in terms destabilizing factors influence.