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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
