Abstract
Control of conflicting flows in a class of time-sharing algorithms with regard for orientation and readjustment is studied. Probabilistic properties of flows are determined by the Markov environment. Conditions for the existence of a stationary operation mode of the system are determined and interpreted graphically. Optimization by the minimum of mean sojourn cost in a control cycle is studied. Imitation modeling is used to estimate the characteristics that cannot be found analytically.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
