The paper considers the model of a network with the nodes being one-server queueing systems. Non-stationary Poisson flows (traffic flows) are input flows to some queueing systems. A statistical simulation… Click to show full abstract
The paper considers the model of a network with the nodes being one-server queueing systems. Non-stationary Poisson flows (traffic flows) are input flows to some queueing systems. 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 flow network of 20 intersections.
               
Click one of the above tabs to view related content.