Abstract. The paper considers a model of the network with nodes being one-server queueing systems. The non-stationary Poisson flows are input flows to some queueing systems (transport flows). A statistical simulation algorithm is proposed. It identifies weak points of the network and allows formulating a heuristic flow control algorithm that reduces the total waiting time. This algorithm is illustrated by an example of a transport network with 20 crossroads.

Keywords: queueing system, nonstationary Poisson flow, Monte Carlo method, Markov chain, flow control.

¹ V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine and National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute,” Ukraine

 kuznetsov2016@icloud.com