Determining Shortest Paths between Two Arbitrary Nodes in a Composite Transport Network Using Segment Routing

Abstract

The task of finding the optimal shortest path is a key task in routing, and new drivers of the development of data transmission technologies require improvements in devices, services and technologies, in particular, in order to adapt existing algorithms and methods for finding shortest paths for segment routing problems. In this case, the key element of determining the shortest path is the metric. Since determining the shortest paths is an important step in forming a composite path within segment routing, determining the correct metric has a strong impact on this process. Segment routing represents an important evolutionary step forward in the design, management and operation of modern transport networks, including the global Internet. This paper considers the possibility of determining the optimal paths between two arbitrary nodes in a composite network using the segment routing methodology. Discusses the relevance of the problem, the issues of determining the minimum path weight, the path with the minimum weight, achieving the minimum delay, determination of the shortest path with segmentation and the problem of the minimum delay path in the segment routing.