Routing procedure in network with nodes dynamic usage rate

In an article it was proposed a computational procedure that provides a solution to the problem of finding a route in a network that minimizes the total duration of the message transmission between nodes of the network, taking into account the nodes dynamics usage. The described procedure is easily realized, its complexity depends linearly on the complexity (number of nodes) of the network.