Paired transitions algorithm of communication links in computer networks based on subnet routing method

The majority of modern routing algorithms in computer networks is based on Bellman-Ford and Dijkstra's algorithms. The efforts to calculate these algorithms lead to the complexity O(N3) and O(N2) correspondingly. Here N is the number of communication nodes or routers in computer network. When changing communication links bandwidth in given algorithms total recalculation of routing tables takes place. The increase of computer network size leads to polynomial growth of efforts to perform this operation. This work offers theoretical research of segmented computer network graph model which gave the opportunity to develop the algorithm allowing to reconstruct the tree of network segment best routes on conditions of graph edges weight change.