The Flows Optimization of the Transport Network by the Criterion of Minimal Transit

Abstract

A method of optimal distribution of digital flows in the transport network by the criterion of minimum transit is proposed, in which the mathematical model of the network is a free-oriented weighted graph with two open poles, and the distribution of flows begins with maximum flows on paths with minimum number of transit nodes. Due to this, in a telecommunication network with dynamically configured channels, the overall productivity increases and the number of transit routes is minimized. This method addressed for usage in the software-defined transport networks.