Properties of the solutions to the task of routing in the network with virtual circuits (Q1975078)

The paper is devoted to the investigation of the structure of optimal solutions in a model of message routing in data networks. The author represent the data network in the form of a nonoriented connected graph \(\Gamma = (U,V)\). The network users are located at the nodes \(u\in U\) of the graph, and the edges \(v\in V\) represent the communication lines. Messages are transmitted between the network nodes in packets over graph routes. The network model discussed in this paper corresponds to the network layer of protocols. A scheme of an algorithm is suggested that optimizes the time of message transmission while conserving the stability of flows in the network.