Abstract:
A class of problems dealing with optimal flow control in the analysis of mathematical models of communication networks is discussed. The control problem consists of the optimal choice of the paths on a given graph and, for fixed paths, in solving a discrete optimal-control problem. A scheme for reduced recurrent inspection of the paths (full inspection may be impossible because of the large volume of the problem) is substantiated, and the convergence of the proposed algorithms is proved.