STOCHASTIC OSCILLATIONS OF PRIORITY QUEUE LENGTH WHEN SERVICING CONFLICT FLOWS BY A PROLONGATION ALGORITHM IN A RANDOM ENVIRONMENT |
1 | |
2009 |
scientific article | 519.21 | ||
112-118 | random environment, conflict flows servicing, stationary mode, iterative-majorant approach |
A queueing system of conflict traffic flows formed in a random environment by automatic traffic lights with
feed-back is studied. Demands from one flow have priority over other demands. The servicing algorithm is cyclic, it
allows service prolongation of non-priority traffic in the absence of priority flow demands. Existence conditions of
priority queue length stationary oscillations are established. |
![]() |